On distance spectral radius of uniform hypergraphs

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 .

Keywords:

• Uniform hypergraph
• distance spectral radius
• distance matrix
• pendant edge
• uniform hypertree

AMS Subject Classifications:

• 05C50
• 05C65
• 15A18

Acknowledgements

We thank the referee for valuable suggestions and comments.

Notes

No potential conflict of interest was reported by the authors.

Additional information

Funding

This work was supported by the National Natural Science Foundation of China [grant number 11671156].