The $p$-spectral radius of the Laplacian
Combinatorics
2016-12-09 v1
Abstract
The -spectral radius of a graph with adjacency matrix is defined as . 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 , and define the -spectral radius of the Laplacian as . We show that relates to invariants such as maximum degree and size of a maximum cut. We also show properties of as a function of , and a upper bound on in terms of for , which is attained if 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}
}