@article{194dea446c0145a5a8de77e784b58688,
title = "Distance spectral radii of k-uniform hypertrees with given parameters",
abstract = "The distance spectral radius of a connected hypergraph is the largest eigenvalue of its distance matrix. In this paper, we obtain the k-uniform hypertree with minimum distance spectral radius among all k-uniform hypertrees with n vertices and matching number r. We also characterize the k-uniform hypertree with minimum distance spectral radius among all k-uniform hypertrees with n vertices and independence number α.",
keywords = "05C50, 05C65, Distance spectral radius, independence number, k-uniform hypertree, matching number",
author = "Xiangxiang Liu and Ligong Wang and Xihe Li",
note = "Publisher Copyright: {\textcopyright} 2019 Informa UK Limited, trading as Taylor & Francis Group.",
year = "2021",
doi = "10.1080/03081087.2019.1682497",
language = "英语",
volume = "69",
pages = "2558--2571",
journal = "Linear and Multilinear Algebra",
issn = "0308-1087",
publisher = "Taylor and Francis Ltd.",
number = "14",
}