TY - JOUR
ID - 112017
TI - Maximum Variable Connectivity Index of n-Vertex Trees
JO - Iranian Journal of Mathematical Chemistry
JA - IJMC
LA - en
SN - 2228-6489
AU - Yousaf, Shamaila
AU - Bhatti, Akhlaq Ahmad
AD - Department of Sciences and Humanities, National University of Computer and Emerging Sciences, Lahore Campus, B-Block, Faisal Town, Lahore, Pakistan
AD - Department of Sciences and Humanities,
National University of Computer and Emerging Sciences, Lahore Campus,
B-Block, Faisal Town, Lahore, Pakistan
Y1 - 2022
PY - 2022
VL - 13
IS - 1
SP - 33
EP - 44
KW - Chemical graph theory
KW - Variable connectivity index
KW - Variable Randić index
KW - Trees
KW - extremal problem
DO - 10.22052/ijmc.2022.243077.1584
N2 - In QSAR and QSPR studies the most commonly used topological index was proposed by chemist Milan Randić in 1975 called Randić branching index or path-one molecular connectivity index, 1χ and it has many applications. In the extension of connectivity indices, in early 1990s, chemist Milan Randic´ introduced variable Randić index deﬁned as ∑v1v2∈E(G) ((dv1 + θ*)(dv2 + θ*))−1/2, where θ* is a non-negative real number and dv1 is the degree of vertex V1 in G. The main objective of the present study is to prove the conjecture proposed in [19]. In this study, we will show that the Pn (path graph) has the maximum variable connectivity index among the collection of trees whose order is n, where n ≥ 4.
UR - https://ijmc.kashanu.ac.ir/article_112017.html
L1 - https://ijmc.kashanu.ac.ir/article_112017_f07c10b0c724a415f616bbe93237be3c.pdf
ER -