Connected Hypergraphs with Small Spectral Radius

By Linyuan Lu, S. Man. 2014

75 citations recorded by the source corpus.

In 1970 Smith classified all connected graphs with the spectral radius at most $2$. Here the spectral radius of a graph is the largest eigenvalue of its adjacency matrix. Recently, the definition of spectral radius has been extended to $r$-uniform hypergraphs. In this paper, we generalize the Smith's theorem to $r$-uniform hypergraphs. We show that the smallest limit point of the spectral radii of connected $r$-uniform hypergraphs is $\rho_r=(r-1)!\sqrt[r]{4}$. We discovered a novel method for computing the spectral radius of hypergraphs, and classified all connected $r$-uniform hypergraphs with spectral radius at most $\rho_r$.

Subfields: Computational Mathematics, Computational Theory and Mathematics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/6927e15f05a33b5ae2b965f0517427ee94d27f59