TY - JOUR
T1 - On the general sum-connectivity index and general Randić index of cacti
AU - Akhter, Shehnaz
AU - Imran, Muhammad
AU - Raza, Zahid
N1 - Publisher Copyright:
© 2016, The Author(s).
PY - 2016/12/1
Y1 - 2016/12/1
N2 - Let G be a connected graph. The degree of a vertex x of G, denoted by dG(x) , is the number of edges adjacent to x. The general sum-connectivity index is the sum of the weights (dG(x)+dG(y))α for all edges xy of G, where α is a real number. The general Randić index is the sum of weights of (dG(x)dG(y))α for all edges xy of G, where α is a real number. The graph G is a cactus if each block of G is either a cycle or an edge. In this paper, we find sharp lower bounds on the general sum-connectivity index and general Randić index of cacti.
AB - Let G be a connected graph. The degree of a vertex x of G, denoted by dG(x) , is the number of edges adjacent to x. The general sum-connectivity index is the sum of the weights (dG(x)+dG(y))α for all edges xy of G, where α is a real number. The general Randić index is the sum of weights of (dG(x)dG(y))α for all edges xy of G, where α is a real number. The graph G is a cactus if each block of G is either a cycle or an edge. In this paper, we find sharp lower bounds on the general sum-connectivity index and general Randić index of cacti.
KW - cacti
KW - general Randić index
KW - general sum-connectivity index
UR - http://www.scopus.com/inward/record.url?scp=84996549568&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84996549568&partnerID=8YFLogxK
U2 - 10.1186/s13660-016-1250-6
DO - 10.1186/s13660-016-1250-6
M3 - Article
AN - SCOPUS:84996549568
SN - 1025-5834
VL - 2016
JO - Journal of Inequalities and Applications
JF - Journal of Inequalities and Applications
IS - 1
M1 - 300
ER -