Name
Abstract | ||
|---|---|---|
The kth power of a graph G, denoted by Gk, is a graph with the same set of vertices as G such that two vertices are adjacent in Gk if and only if their distance in G is at most k. In this paper, we give upper and lower bounds on the Aα-spectral radius of G2. Furthermore, the first three largest Aα-spectral radius of the second power of trees are determined. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.amc.2019.04.077 | Applied Mathematics and Computation |
Keywords | DocType | Volume |
kth power of a graph,Tree,Aα-spectral radius | Journal | 359 |
ISSN | Citations | PageRank |
0096-3003 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuanyuan Chen | 1 | 45 | 12.24 |
| Dan Li | 2 | 1 | 0.72 |
| Zhiwen Wang | 3 | 1 | 1.02 |
| Jixiang Meng | 4 | 353 | 55.62 |