pith. sign in

arxiv: 1612.02643 · v1 · pith:37HXFJX6new · submitted 2016-12-08 · 🧮 math.CO

The p-spectral radius of the Laplacian

classification 🧮 math.CO
keywords laplacianradiusspectralgraphinvariantsmatrixmaximumadjacency
0
0 comments X
read the original abstract

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

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.