Indexed metadata

Uniform Hypergraphs with αα-Spectral Radius at Most That of a Loose Cycle

Hangxi Cha, Xiaoqi Liu, Haiying Shan

Source record

Source: arXiv

Published: Sep 21, 2026

arXiv: 2609.24024

Open original source ↗

Source abstract

Let k3k\geq 3 and α[0,1)α\in[0,1), and let λk(α)λ_k(α) denote the αα-spectral radius of a kk-uniform loose cycle. Lu and Man classified all connected kk-uniform hypergraphs with adjacency spectral radius at most λk(0)λ_k(0). In this paper, we extend their classification to the αα-spectral setting. In particular, for every k3k\geq 3 and 0<α<10<α<1, we prove that λk(α)λ_k(α) is the smallest limit point of the αα-spectral radii of connected kk-uniform hypergraphs. Moreover, we give a complete comparison between the αα-spectral radius of an arbitrary finite connected kk-uniform hypergraph HH and that of a loose cycle by determining the sign of ρα(H)λk(α)ρ_α(H)-λ_k(α). As a consequence, for each fixed 0<α<10<α<1, we classify all finite connected kk-uniform hypergraphs with αα-spectral radius at most λk(α)λ_k(α).

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.