Eigenvalue bounds for the signless $p$-Laplacian
Combinatorics
2016-10-06 v1
Abstract
We consider the signless -Laplacian of a graph, a generalisation of the usual signless Laplacian (the case ). 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 upper and lower bounds coincide.
Cite
@article{arxiv.1610.01357,
title = {Eigenvalue bounds for the signless $p$-Laplacian},
author = {Elizandro Max Borba and Uwe Schwerdtfeger},
journal= {arXiv preprint arXiv:1610.01357},
year = {2016}
}
Comments
12 pages