Distance spectral radii of k-uniform hypertrees with given parameters

Xiangxiang Liu, Ligong Wang, Xihe Li

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

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 languageEnglish
Pages (from-to)2558-2571
Number of pages14
JournalLinear and Multilinear Algebra
Volume69
Issue number14
DOIs
StatePublished - 2021

Keywords

  • 05C50
  • 05C65
  • Distance spectral radius
  • independence number
  • k-uniform hypertree
  • matching number

Cite this