Some spectral properties of uniform hypergraphs
Jiang Zhou, Lizhu Sun, Wenzhe Wang, Changjiang Bu

TL;DR
This paper explores spectral properties of uniform hypergraphs, deriving trace formulas for the Laplacian tensor, characterizations of hypergraph classes, and verifying conjectures under specific conditions.
Contribution
It introduces new trace formulas for the Laplacian tensor, spectral characterizations of hypergraph classes, and partial answers to existing conjectures.
Findings
Sum of degree powers determined by Laplacian spectrum
Spectral characterizations of odd-bipartite hypergraphs
Verification of a conjecture under certain conditions
Abstract
For a -uniform hypergraph , we obtain some trace formulas for the Laplacian tensor of , which imply that () is determined by the Laplacian spectrum of , where is the degree sequence of . Using trace formulas for the Laplacian tensor, we obtain expressions for some coefficients of the Laplacian polynomial of a regular hypergraph. We give some spectral characterizations of odd-bipartite hypergraphs, and give a partial answer to a question posed by Shao et al \cite{ShaoShanWu}. We also give some spectral properties of power hypergraphs, and show that a conjecture posed by Hu et al \cite{HuQiShao} holds under certain conditons.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTensor decomposition and applications · Advanced Neuroimaging Techniques and Applications · Matrix Theory and Algorithms
