Name
Abstract | ||
|---|---|---|
The Randić index is the topological index most widely used in applications for chemistry and pharmacology. It is defined for a graph G with vertex set V(G) and edge set E(G) asR(G)=∑uv∈E(G)1deg(u)deg(v),where deg(u) and deg(v) denote the degrees of the vertices u, v ∈ V(G). In this paper we find upper and lower bounds of the Randić index of trees in terms of the order and the domination number. The extremal trees are characterized. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.amc.2020.125122 | Applied Mathematics and Computation |
Keywords | Field | DocType |
Randić index,Domination number | Graph,Combinatorics,Vertex (geometry),Upper and lower bounds,Mathematical analysis,Domination analysis,Mathematics,Topological index | Journal |
Volume | ISSN | Citations |
375 | 0096-3003 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sergio Bermudo | 1 | 0 | 0.34 |
| Juan E. Nápoles | 2 | 0 | 0.34 |
| Juan Rada | 3 | 36 | 10.02 |