Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4598724 | Linear Algebra and its Applications | 2016 | 17 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
Authors
Xiying Yuan, Jiayu Shao, Haiying Shan,