
arXiv: 1610.01357
We consider the signless $p$-Laplacian $Q_p$ of a graph, a generalisation of the quadratic form of the signless Laplacian matrix (the case $p=2$). In analogy to Rayleigh's principle the minimum and maximum of $Q_p$ on the $p$-norm unit sphere are called its smallest and largest eigenvalues, respectively. We show a Perron-Frobenius property and basic inequalites for the largest eigenvalue and provide upper and lower bounds for the smallest eigenvalue in terms of a graph parameter related to the bipartiteness. The latter result generalises bounds by Desai and Rao and, interestingly, at $p=1$ upper and lower bounds coincide.
Connectivity, Eigenvalues, singular values, and eigenvectors, 05C50, 05C40, 15A18, Graphs and linear algebra (matrices, eigenvalues, etc.), FOS: Mathematics, eigenvalue bound, Mathematics - Combinatorics, signless \(p\)-Laplacian, Combinatorics (math.CO), signless Laplacian
Connectivity, Eigenvalues, singular values, and eigenvectors, 05C50, 05C40, 15A18, Graphs and linear algebra (matrices, eigenvalues, etc.), FOS: Mathematics, eigenvalue bound, Mathematics - Combinatorics, signless \(p\)-Laplacian, Combinatorics (math.CO), signless Laplacian
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
