Skip to main navigation Skip to search Skip to main content

Coloring the normalized Laplacian for oriented hypergraphs

Research output: Contribution to JournalArticleAcademicpeer-review

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 languageEnglish
Pages (from-to)192-207
Number of pages16
JournalLinear Algebra and its Applications
Volume629
Early online date28 Jul 2021
DOIs
Publication statusPublished - 15 Nov 2021
Externally publishedYes

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 .

FundersFunder number
Fonds Wetenschappelijk Onderzoek1285921N

    Fingerprint

    Dive into the research topics of 'Coloring the normalized Laplacian for oriented hypergraphs'. Together they form a unique fingerprint.

    Cite this