arXiv (All)
open access
Uniform Hypergraphs with $α$-Spectral Radius at Most That of a Loose Cycle
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 part
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The maximum spectral radius of uniform hypergraphs whose shadow excludes a complete or complete bipartite minor#1037053
- On the saturation number of the kite graph#620489
- On the saturation number of the kite graph#618810
- On the Turán number of the expansion of the book#822329
- On Aubry's completeness conjecture#1084196
Record · ID 1050210
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive