The Signless Laplacian Matrix of Hypergraphs
Spectral Theory
2024-08-12 v2 Combinatorics
Abstract
In this paper we define signless Laplacian matrix of a hypergraph and obtain structural properties from its eigenvalues. We generalize several known results for graphs, relating the spectrum of this matrix with structural parameters of the hypergraph such as the maximum degree, diameter and the chromatic number. In addition, we characterize the complete signless Laplacian spectrum for the class of the power hypergraphs from the spectrum of its base hypergraph.
Keywords
Cite
@article{arxiv.1909.00246,
title = {The Signless Laplacian Matrix of Hypergraphs},
author = {Kauê Cardoso and Vilmar Trevisan},
journal= {arXiv preprint arXiv:1909.00246},
year = {2024}
}
Comments
Keywords - Spectral hypergraph theory; Signless Laplacian; Power hypergraph