Extremal Trees with Respect to the Difference between Atom-Bond Connectivity Index and Randić Index
Keyword(s):
Let G be a simple, connected and undirected graph. The atom-bond connectivity index (ABC(G)) and Randić index (R(G)) are the two most well known topological indices. Recently, Ali and Du (2017) introduced the difference between atom-bond connectivity and Randić indices, denoted as ABC−R index. In this paper, we determine the fourth, the fifth and the sixth maximum chemical trees values of ABC−R for chemical trees, and characterize the corresponding extremal graphs. We also obtain an upper bound for ABC−R index of such trees with given number of pendant vertices. The role of symmetry has great importance in different areas of graph theory especially in chemical graph theory.
On the difference between atom-bond connectivity index and Randić index of binary and chemical trees
2017 ◽
Vol 117
(23)
◽
pp. e25446
◽
Keyword(s):
Keyword(s):
2002 ◽
Vol 67
(2)
◽
pp. 87-97
◽
Keyword(s):
2017 ◽
Vol 95
(6)
◽
pp. 674-686
◽
Keyword(s):
Keyword(s):
2013 ◽
Vol 2013
◽
pp. 1-7
◽
Keyword(s):