Name
Title | ||
|---|---|---|
Some graft transformations and its applications on the distance spectral radius of a graph. |
Abstract | ||
|---|---|---|
Let D(G)=(di,j)n×n denote the distance matrix of a connected graph G with order n, where dij is equal to the distance between vi and vj in G. The largest eigenvalue of D(G) is called the distance spectral radius of graph G, denoted by ϱ(G). In this paper, some graft transformations that decrease or increase ϱ(G) are given. With them, for the graphs with both order n and k pendant vertices, the extremal graphs with the minimum distance spectral radius are completely characterized; the extremal graph with the maximum distance spectral radius is shown to be a dumbbell graph (obtained by attaching some pendant edges to each pendant vertex of a path respectively) when 2≤k≤n−2; for k=1,2,3,n−1, the extremal graphs with the maximum distance spectral radius are completely characterized. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.aml.2011.09.007 | Applied Mathematics Letters |
Keywords | Field | DocType |
Graft transformation,Distance spectral radius,Pendant number | Dumbbell,Combinatorics,Spectral radius,Vertex (geometry),Bound graph,Distance matrix,Resistance distance,Connectivity,Mathematics,Eigenvalues and eigenvectors | Journal |
Volume | Issue | ISSN |
25 | 3 | 0893-9659 |
Citations | PageRank | References |
4 | 0.78 | 6 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guanglong Yu | 1 | 28 | 11.07 |
| Huicai Jia | 2 | 4 | 1.80 |
| Hailiang Zhang | 3 | 5 | 1.84 |
| Jinlong Shu | 4 | 99 | 24.28 |