Uniform Hypergraphs with α-Spectral Radius at Most That of a Loose Cycle
Hangxi Cha, Xiaoqi Liu, Haiying Shan
Abstract
Let k≥ 3 and α∈[0,1), and let λk(α) denote the α-spectral radius of a k-uniform loose cycle. Lu and Man classified all connected k-uniform hypergraphs with adjacency spectral radius at most λk(0). In this paper, we extend their classification to the α-spectral setting. In particular, for every k≥ 3 and 0<α<1, we prove that λk(α) is the smallest limit point of the α-spectral radii of connected k-uniform hypergraphs. Moreover, we give a complete comparison between the α-spectral radius of an arbitrary finite connected k-uniform hypergraph H and that of a loose cycle by determining the sign of ρα(H)-λk(α). As a consequence, for each fixed 0<α<1, we classify all finite connected k-uniform hypergraphs with α-spectral radius at most λk(α).
Create a lesson
Related papers
A Polytopal Realization of Higher-Categorical Associahedra
Spencer Backman, Nathaniel Bottman, Daria Poliakova
An infinite family of intransitive directed strongly regular graphs with rank 6 Weisfeiler--Leman closure
Štefan Gyürki
Maximizing the number of cliques in Kr+1-free graphs with forbidden properties
Aleyah Dawkins, Rachel Kirsch
On Smooth Combinatorial Products of Simplices
Juliana Curtis, Tuong Le, Chayim Lowen
Characterization of tree-child networks in terms of mu vectors
Toni Fuentes, Vincent Moulton, Katharina T. Huber et al.
Extremal subtrees of critical beta-splitting trees
Anna Brandenberger, Byron Chin, Elchanan Mossel