Eigenvalue bounds for the signless p-Laplacian
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 1 upper and lower bounds coincide.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.