@article{253157be0fbc437e8f144fff4a24c053,
title = "The first two largest spectral radii of uniform supertrees with given diameter",
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.",
keywords = "Diameter, Hypergraph, Spectral radius, Supertree",
author = "Peng Xiao and Ligong Wang and Yanfei Du",
note = "Publisher Copyright: {\textcopyright} 2017 Elsevier Inc.",
year = "2018",
month = jan,
day = "1",
doi = "10.1016/j.laa.2017.09.009",
language = "英语",
volume = "536",
pages = "103--119",
journal = "Linear Algebra and Its Applications",
issn = "0024-3795",
publisher = "Elsevier Inc.",
}