English

Eigenvalue bounds for the signless $p$-Laplacian

Combinatorics 2016-10-06 v1

Abstract

We consider the signless pp-Laplacian of a graph, a generalisation of the usual signless Laplacian (the case p=2p=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 p1p\to 1 upper and lower bounds coincide.

Keywords

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

R2 v1 2026-06-22T16:11:15.979Z