Some results on extremal spectral radius of hypergraph
Guanglong Yu

TL;DR
This paper investigates the spectral radius of hypergraphs, deriving formulas linking it to ordinary graphs, and determines extremal hypergraphs with respect to spectral radius under various structural constraints.
Contribution
The paper provides explicit formulas connecting hypergraph spectral radius to graph spectra and characterizes extremal hypergraphs for fixed parameters.
Findings
Identified hypergraphs with minimum and second minimum spectral radius among unicyclic hypergraphs.
Determined hypergraphs with maximum spectral radius given fixed girth.
Showed spectral radius decreases as girth increases in lollipop hypergraphs.
Abstract
For a with a nonempty vertex set and an edge set , its is defined as , where . The of a hypergraph , denoted by , is the maximum modulus among all eigenvalues of . In this paper, we get a formula about the spectral radius which link the ordinary graph and the hypergraph, and represent some results on the spectral radius changing under some graphic structural perturbations. Among all -uniform () unicyclic hypergraphs with fixed number of vertices, the hypergraphs with the minimum, the second the minimum spectral radius are completely…
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
TopicsGraph theory and applications · Nuclear Receptors and Signaling
