On the spectrum of hypergraphs

Here, we introduce different connectivity matrices and study their eigenvalues to explore various structural properties of a general hypergraph. We investigate how the diameter, connectivity and vertex chromatic number of a hypergraph are related to the spectrum of these matrices. Different properti...

Full description

Saved in:
Bibliographic Details
Published inLinear algebra and its applications Vol. 614; pp. 82 - 110
Main Author Banerjee, Anirban
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier Inc 01.04.2021
American Elsevier Company, Inc
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Here, we introduce different connectivity matrices and study their eigenvalues to explore various structural properties of a general hypergraph. We investigate how the diameter, connectivity and vertex chromatic number of a hypergraph are related to the spectrum of these matrices. Different properties of a regular hypergraph are also characterized by the same. Cheeger constant on a hypergraph is defined and its spectral bounds have been derived for a connected general hypergraph. Random walk on a general hypergraph can also be well studied by analyzing the spectrum of the transition probability operator defined on the hypergraph. We also introduce Ricci curvature on a general hypergraph and study its relation with the hypergraph spectra.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0024-3795
1873-1856
DOI:10.1016/j.laa.2020.01.012