Search arXivSearch

arXiv · 2609.24024

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

Abstract

Let $k\geq 3$ and $α\in[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\geq 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(α)$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hangxi Cha, Xiaoqi Liu, Haiying Shan. 2026-09-21. Uniform Hypergraphs with $α$-Spectral Radius at Most That of a Loose Cycle. https://arxiv.org/abs/2609.24024

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO