Ordering uniform supertrees by their spectral radii
Combinatorics
2015-02-24 v1
Abstract
A connected and acyclic hypergraph is called a supertree. In this paper we mainly focus on the spectral radii of uniform supertrees. Li, Shao and Qi determined the first two -uniform supertrees with large spectral radii among all the -uniform supertrees on vertices [H. Li, J. Shao, L. Qi, The extremal spectral radii of -uniform supertrees, arXiv:1405.7257v1, May 2014]. By applying the operation of moving edges on hypergraphs and using the weighted incidence matrix method we extend the above order to the fourth -uniform supertree.
Keywords
Cite
@article{arxiv.1502.06474,
title = {Ordering uniform supertrees by their spectral radii},
author = {Xiying Yuan},
journal= {arXiv preprint arXiv:1502.06474},
year = {2015}
}
Comments
arXiv admin note: text overlap with arXiv:1405.7257 by other authors