Yi-Zheng Fan, Ying-Ying Tan, Xi-Xi Peng, An-Hong Liu
Published 2015-02-15Version 1
In this paper we investigate the hypergraphs whose spectral radii attain the maximum among all uniform hypergraphs with given number of edges. In particular we characterize the hypergraph(s) with maximum spectral radius over all unicyclic hypergraphs, linear or power unicyclic hypergraphs with given grith, linear or power bicyclic hypergraphs, respectively.
On the spectral radius of a class of non-odd-bipartite even uniform hypergraphs
Total Transversals and Total Domination in Uniform Hypergraphs
Distance spectral radius of uniform hypergraphs
![QR code for arXiv:1502.04271 [math.CO]](http://oss.arxitics.com/images/favicon.svg)