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.
| Original language | English |
|---|---|
| Pages (from-to) | 192-207 |
| Number of pages | 16 |
| Journal | Linear Algebra and its Applications |
| Volume | 629 |
| Early online date | 28 Jul 2021 |
| DOIs | |
| Publication status | Published - 15 Nov 2021 |
| Externally published | Yes |
Funding
The authors are grateful to the anonymous referee for the comments and suggestions that have greatly improved the first version of this paper. The research of A. Abiad is partially supported by the FWO grant 1285921N .
| Funders | Funder number |
|---|---|
| Fonds Wetenschappelijk Onderzoek | 1285921N |
Fingerprint
Dive into the research topics of 'Coloring the normalized Laplacian for oriented hypergraphs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver