@article{0c3c13af7fa94033895a801f56a125c4,
title = "Distance spectral radii of k-uniform hypertrees with fixed diameter",
abstract = "The distance spectral radius of a connected hypergraph is the largest eigenvalue of its distance matrix. In this paper, we determine the k-uniform hypertree with the minimal spectral radius among all k-uniform hypertrees with m edges and diameter d, where 3≤d≤m-1.",
keywords = "Diameter, Distance spectral radius, k-uniform hypertree",
author = "Xiangxiang Liu and Ligong Wang",
note = "Publisher Copyright: {\textcopyright} The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024.",
year = "2024",
month = jun,
doi = "10.1007/s10801-024-01316-z",
language = "英语",
volume = "59",
pages = "899--915",
journal = "Journal of Algebraic Combinatorics",
issn = "0925-9899",
publisher = "Springer Netherlands",
number = "4",
}