2017•Linear and Multilinear AlgebraRequires access
On distance spectral radius of uniform hypergraphs
Hongying Lin, Bo Zhou, Yaduan Li
Open publisher page 9 citations
Abstract
The distance spectral radius of a connected hypergraph is the largest eigenvalue of its distance matrix. We determine the unique connected k-uniform hypergraphs with minimum distance spectral radius when the number of pendant edges is given, the unique k-uniform non-hyperstar-like hypertrees (non-hyper-caterpillars, respectively) with minimum distance spectral radius, and the unique k-uniform non-hyper-caterpillars with maximum distance spectral radius for .