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 α.
Original language | English |
---|---|
Pages (from-to) | 2558-2571 |
Number of pages | 14 |
Journal | Linear and Multilinear Algebra |
Volume | 69 |
Issue number | 14 |
DOIs | |
State | Published - 2021 |
Keywords
- 05C50
- 05C65
- Distance spectral radius
- independence number
- k-uniform hypertree
- matching number