Maximizing spectral radii of uniform hypergraphs with few edges
Combinatorics
2017-09-07 v2
Abstract
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 girth, linear or power bicyclic hypergraphs, respectively.
Keywords
Cite
@article{arxiv.1502.04271,
title = {Maximizing spectral radii of uniform hypergraphs with few edges},
author = {Yi-Zheng Fan and Ying-Ying Tan and Xi-Xi Peng and An-Hong Liu},
journal= {arXiv preprint arXiv:1502.04271},
year = {2017}
}