Name
Abstract | ||
|---|---|---|
Let G be a graph of order n with vertex set V(G)={v1,v2,…,vn} and edge set E(G), and d(vi) be the degree of the vertex vi. The geometric-arithmetic matrix of G, recently introduced by Rodríguez and Sigarreta, is the square matrix of order n whose (i, j)-entry is equal to 2d(vi)d(vj)d(vi)+d(vj) if vivj ∈ E(G), and 0 otherwise. The geometric-arithmetic energy of G is the sum of the absolute values of the eigenvalues of geometric-arithmetic matrix of G. In this paper, we characterize the tree of order n which has the maximal geometric-arithmetic energy among all trees of order n with at most two branched vertices. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.amc.2019.06.042 | Applied Mathematics and Computation |
Keywords | Field | DocType |
Tree,Geometric-arithmetic index,Geometric-arithmetic energy | Graph,Combinatorics,Vertex (geometry),Matrix (mathematics),Mathematical analysis,Absolute value,Square matrix,Mathematics,Eigenvalues and eigenvectors | Journal |
Volume | ISSN | Citations |
362 | 0096-3003 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yanling Shao | 1 | 4 | 4.96 |
| Yu-Bin Gao | 2 | 6 | 7.70 |