Eigenvalue bounds for the signless p-Laplacian
classification
🧮 math.CO
keywords
boundseigenvaluelaplaciansignlesslowerupperbasicbipartiteness
read the original abstract
We consider the signless $p$-Laplacian of a graph, a generalisation of the usual signless Laplacian (the case $p=2$). 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 parameter related to the bipartiteness. The latter result generalises bounds by Desai and Rao and, interestingly, in the limit $p\to 1$ upper and lower bounds coincide.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.