The Signless Laplacian Matrix of Hypergraphs
arXiv:1909.00246 · doi:10.1515/spma-2022-0166
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.
arXiv commentKeywords - Spectral hypergraph theory; Signless Laplacian; Power hypergraph
References in corpus (6)
- Spectra of general hypergraphs
- An Oriented Hypergraphic Approach to Algebraic Graph Theory
- Spectral Properties of Oriented Hypergraphs
- Ensemble-marginalized Kalman filter for linear time-dependent PDEs with noisy boundary conditions: Application to heat transfer in building walls
- Energies of Hypergraphs
- The spectrum of a class of uniform hypergraphs