Name
Abstract | ||
|---|---|---|
Let G = (V (G), E(G)) be a graph with V (G) = {v(1), v(2),..., v(n)}. The Randic matrix of G is an n x n matrix R (G) = (r(ij)) with r(ij) = 1/root d(G)(v(i))d(G)(v(j)) if v(i)v(j) is an element of E(G), and r(ij) = 0 if v(i)v(j) is not an element of E(G), where d(G)(v(i)) is the degree of v(i) in G for i = 1, 2,..., n. The Randicenergy of G is the sum of the absolute values of the eigenvalues of R(G).Let T-n,T-d be the set of trees of order n with diameter 3 <= d <= n - 2, and T (n, d; n(1), n(2),..., n(d-1)) is an element of T-n,T-d be a caterpillar obtained from a path v(0)v(1)... v(d) by adding n(i) (n(i) >= 0) pendent edges to v(i) (i = 1,..., d - 1).It is shown that T (n, d; n - d - 1, 0,..., 0) is the unique tree with minimal Randicenergy in T-n,T-d. (C) 2021 Elsevier Inc. All rights reserved. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1016/j.amc.2021.126489 | APPLIED MATHEMATICS AND COMPUTATION |
Keywords | DocType | Volume |
Tree, Energy, Randic matrix, Randic energy | Journal | 411 |
ISSN | Citations | PageRank |
0096-3003 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yu-Bin Gao | 1 | 6 | 7.70 |
| Wei Gao | 2 | 0 | 0.68 |
| Yanling Shao | 3 | 4 | 4.96 |