arXiv · 1909.00246
The Signless Laplacian Matrix of Hypergraphs
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.
Explore related subjects
Keep this discovery
Kauê Cardoso, Vilmar Trevisan. 2019-08-31. The Signless Laplacian Matrix of Hypergraphs. https://doi.org/10.1515/spma-2022-0166
Cite the original work for its findings. Save a collection to share your selection of sources.