Distance spectral radii of k-uniform hypertrees with given parameters. Issue 14 (26th October 2021)

• Record Type: Journal Article
• Authors: Liu, Xiangxiang; Wang, Ligong; Li, Xihe
• Is Part Of: Linear & multilinear algebra. Volume 69:Issue 14(2021)
• Page Start: 2558
• Page End: 2571
• Publication Date: 2021-10-26
• Subjects: Distance spectral radius -- k-uniform hypertree -- matching number -- independence number; 05C50 -- 05C65; Algebras, Linear -- Periodicals; Multilinear algebra -- Periodicals; 512.505
• DOI: 10.1080/03081087.2019.1682497
• Languages: English
• ISSNs: 0308-1087

Abstract

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 α .