Ordering of some uniform supertrees with larger spectral radii

By Xiying Yuan, J. Shao, H. Shan. 2016

52 citations recorded by the source corpus.

Abstract A supertree is a connected and acyclic hypergraph. We study some uniform supertrees with larger spectral radii. We first define a new type of edge-moving operation on hypergraphs, and study its applications on the comparison of the spectral radii of hypergraphs. By using this new operation on some supertrees together with the general edge-moving operation introduced by Li, Shao and Qi in 2015, and using a result by Zhou et al. in 2014 about the relation between the spectral radii of an ordinary graph and its power hypergraph, we are able to determine the first eight k -uniform supertrees on n vertices with the largest spectral radii.

Subfields: Computational Mathematics

View Paper: https://www.semanticscholar.org/paper/064a0e1e0ee7359b004b7866e08d3268e6c2c1eb