English

The $p$-spectral radius of the Laplacian

Combinatorics 2016-12-09 v1

Abstract

The pp-spectral radius of a graph G=(V,E)G=(V,E) with adjacency matrix AA is defined as λ(p)(G)=max{xTAx:xp=1}\lambda^{(p)}(G)=\max \{x^TAx : \|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 LL, and define the pp-spectral radius of the Laplacian as μ(p)(G)=max{xTLx:xp=1}\mu^{(p)}(G)=\max \{x^TLx : \|x\|_p=1 \}. We show that μ(p)(G)\mu^{(p)}(G) relates to invariants such as maximum degree and size of a maximum cut. We also show properties of μ(p)(G)\mu^{(p)}(G) as a function of pp, and a upper bound on maxG ⁣:V(G)=nμ(p)(G)\max_{G \colon |V(G)|=n} \mu^{(p)}(G) in terms of n=Vn=|V| for p2p\ge 2, which is attained if nn is even.

Keywords

Cite

@article{arxiv.1612.02643,
  title  = {The $p$-spectral radius of the Laplacian},
  author = {Elizandro Max Borba and Sebastian Richter and Eliseu Fritscher and Carlos Hoppen},
  journal= {arXiv preprint arXiv:1612.02643},
  year   = {2016}
}