Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5773031 | Linear Algebra and its Applications | 2018 | 17 Pages |
Abstract
A supertree is a connected and acyclic hypergraph. Let S(m,d,k) be the set of k-uniform supertrees with m edges and diameter d. In this paper, we determine the supertrees with the first two largest spectral radii among all supertrees in S(m,d,k) for 3â¤dâ¤mâ1.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
Authors
Peng Xiao, Ligong Wang, Yanfei Du,