Contents

Ars Combinatoria

  • Research article

Distance Spectral Radius of a Tree with Given Diameter

Guanglong Yu1, Shuguang Guo1, Mingqing Zhai2
1Department of Mathematics, Yancheng Teachers University, Yancheng, 224002, Jiangsu, P.R. China
2Department of Mathematics, Chuzhou University, Chuzhou, 239012, Anhui, P.R. China
  • Published: 31/07/2017

Abstract

For a connected graph, the distance spectral radius is the largest eigenvalue of its distance matrix. In this paper, of all trees with both given order and fixed diameter, the trees with the minimal distance spectral radius are completely characterized.

Citation
Guanglong Yu, Shuguang Guo, Mingqing Zhai. Distance Spectral Radius of a Tree with Given Diameter[J], Ars Combinatoria, Volume 134. 351-362. .