Name
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. |
Year | Venue | Keywords |
|---|---|---|
2017 | ARS COMBINATORIA | Distance matrix,Spectral radius,Tree,Diameter |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Spectral radius,Radius of curvature,Radius,Distance matrix,Connectivity,Eigenvalues and eigenvectors,Mathematics | Journal | 134 |
ISSN | Citations | PageRank |
0381-7032 | 0 | 0.34 |
References | Authors | |
4 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guanglong Yu | 1 | 28 | 11.07 |
| Shu-Guang Guo | 2 | 1 | 2.42 |
| Mingqing Zhai | 3 | 18 | 6.26 |