The first few unicyclic and bicyclic hypergraphs with larger spectral radii

Chen Ouyang, Liqun Qi, Xiying Yuan

A connected $k$-uniform hypergraph with $n$ vertices and $m$ edges is called $r$-cyclic if $n=m(k-1)-r+1$. For $r=1$ or $2$, the hypergraph is simply called unicyclic or bicyclic.…