Among r-th power hypertrees with m edges and k pendant paths of length l (r≥3, kl<m), there is a unique hypertree that achieves the maximum distance spectral radius and a unique one that achieves the minimum.
Aequationes Math
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On distance spectral radius of power hypertrees with given number of pendant paths of fixed length
Among r-th power hypertrees with m edges and k pendant paths of length l (r≥3, kl<m), there is a unique hypertree that achieves the maximum distance spectral radius and a unique one that achieves the minimum.