The p-spectral radius of the Laplacian
Abstract
The p-spectral radius of a graph G=(V,E) with adjacency matrix A is defined as λ(p)(G)= \xTAx : \|x\|p=1 \. This parameter shows remarkable connections with graph invariants, and has been used to generalize some extremal problems. In this work, we extend this approach to the Laplacian matrix L, and define the p-spectral radius of the Laplacian as μ(p)(G)= \xTLx : \|x\|p=1 \. We show that μ(p)(G) relates to invariants such as maximum degree and size of a maximum cut. We also show properties of μ(p)(G) as a function of p, and a upper bound on G |V(G)|=n μ(p)(G) in terms of n=|V| for p 2, which is attained if n is even.
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.