Uniform Hypergraphs with -Spectral Radius at Most That of a Loose Cycle
Hangxi Cha, Xiaoqi Liu, Haiying Shan
Source abstract
Let and , and let denote the -spectral radius of a -uniform loose cycle. Lu and Man classified all connected -uniform hypergraphs with adjacency spectral radius at most . In this paper, we extend their classification to the -spectral setting. In particular, for every and , we prove that is the smallest limit point of the -spectral radii of connected -uniform hypergraphs. Moreover, we give a complete comparison between the -spectral radius of an arbitrary finite connected -uniform hypergraph and that of a loose cycle by determining the sign of . As a consequence, for each fixed , we classify all finite connected -uniform hypergraphs with -spectral radius at most .
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.