Coloring the normalized Laplacian for oriented hypergraphs
arXiv:2008.03269 · doi:10.1016/j.laa.2021.07.018
Abstract
The independence number, coloring number and related parameters are investigated in the setting of oriented hypergraphs using the spectrum of the normalized Laplace operator. For the independence number, both an inertia--like bound and a ratio--like bound are shown. A Sandwich Theorem involving the clique number, the vector chromatic number and the coloring number is proved, as well as a lower bound for the vector chromatic number in terms of the smallest and the largest eigenvalue of the normalized Laplacian. In addition, spectral partition numbers are studied in relation to the coloring number.
arXiv commentLinear Algebra and Its Applications, To appear
References in corpus (11)
- Coupled Dynamics on Hypergraphs: Master Stability of Steady States and Synchronization
- An Oriented Hypergraphic Approach to Algebraic Graph Theory
- Spectral Properties of Oriented Hypergraphs
- Spectral Theory of Laplace Operators on Oriented Hypergraphs
- A Characterization of Oriented Hypergraphic Laplacian and Adjacency Matrix Coefficients
- Incidence Hypergraphs: Injectivity, Uniformity, and Matrix-tree Theorems
- Independent sets in hypergraphs with a forbidden link
- Signless Normalized Laplacian for Hypergraphs
- Sharp bounds for the largest eigenvalue
- Incidence Hypergraphs: Box Products & the Laplacian
- The independence number of non-uniform uncrowded hypergraphs and an anti-Ramsey type result