@article {
author = {Yousaf, Shamaila and Bhatti, Akhlaq Ahmad},
title = {Maximum Variable Connectivity Index of n-Vertex Trees},
journal = {Iranian Journal of Mathematical Chemistry},
volume = {13},
number = {1},
pages = {33-44},
year = {2022},
publisher = {University of Kashan},
issn = {2228-6489},
eissn = {2008-9015},
doi = {10.22052/ijmc.2022.243077.1584},
abstract = {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.},
keywords = {Chemical graph theory,Variable connectivity index,Variable Randić index,Trees,extremal problem},
url = {https://ijmc.kashanu.ac.ir/article_112017.html},
eprint = {https://ijmc.kashanu.ac.ir/article_112017_f07c10b0c724a415f616bbe93237be3c.pdf}
}