On the spectral radius of nonregular uniform hypergraphs
Jiang Zhou, Lizhu Sun, Changjiang Bu

TL;DR
This paper investigates bounds on the spectral radius and eigenvalues of connected uniform hypergraphs, extending known graph results to hypergraph spectral theory.
Contribution
It provides new lower bounds for the difference between maximum degree and spectral radius, and for the sum of maximum degree and minimum H-eigenvalue in hypergraphs.
Findings
Lower bounds for Δ - λ in hypergraphs
Lower bounds for Δ + μ in hypergraphs
Extension of graph eigenvalue results to hypergraphs
Abstract
Let be a connected uniform hypergraphs with maximum degree , spectral radius and minimum H-eigenvalue . In this paper, we give some lower bounds for , which extend the result of [S.M. Cioab\u{a}, D.A. Gregory, V. Nikiforov, Extreme eigenvalues of nonregular graphs, J. Combin. Theory, Ser. B 97 (2007) 483-486] to hypergraphs. Applying these bounds, we also obtain a lower bound for .
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 · Graph theory and applications · Matrix Theory and Algorithms
