Maximum Variable Connectivity Index of n-Vertex Trees

Document Type : Research Paper

Authors

1 Department of Sciences and Humanities, National University of Computer and Emerging Sciences, Lahore Campus, B-Block, Faisal Town, Lahore, Pakistan

2 Department of Mathematics, University of Gujrat, Gujrat, Pakistan

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 defined 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

References

  1. Akhter, M. Imran and Z. Raza, Bounds for the general sum-connectivity index of composite graphs, J. Inequal. Appl. 2017 (2017) 76, 12pp.
  2. Ali, Z. Du and K. Shehzadi, Estimating some general molecular descriptors of saturated hydrocarbons, Mol. Inf. 38 (11-12) (2019) e1900007.
  3. Amić, D. Davidovic-Amić, D. Bešlo, B. Lučić, N. Trinajstić and S. Nikolić, The vertex-connectivity index revisited, J. Chem. Inf. Comput. Sci. 38 (1998) 819–822.
  4. Behtoei, Some relations and bounds for the general first zagreb index, MATCH Commun. Math. Comput. Chem. 81 (2019) 361–370.
  5. Dimitrov and A. Ali, On the extremal graphs with respect to the variable sum exdeg index, Discrete Math. Lett. 1 (2019) 42–48.
  6. G. Domenech, J. Gálvez, J. V. de Julián-Ortiz and L. Pogliani, Some new trends in chemical graph theory, Chem. Rev. 108 (2008) 1127–1169.
  7. Elumalai and T. Mansour, On the general zeroth-order Randić index of bargraphs, Discrete Math. Lett. 2 (2019) 6–9.
  8. Harary, Graph Theory. Addison-Wesley Pub. Co., Reading, MA, 1969.
  9. Hayat, On generalized atom-bond connectivity index of cacti, Iranian J. Math.Chem. 10 (4) (2019) 319–330.
  10. Martínez-Pérez and J. M. Rodríguez, A unified approach to bounds for topological indices on trees and applications, MATCH Commun. Math. Comput. Chem. 82 (3) (2019) 679–698.
  11. Randić and S. C. Bašak, On use of the variable connectivity index 1χf in QSAR:Toxicity of aliphatic ethers, J. Chem. Inf. Comput. Sci. 41 (2001) 614–618.
  12. Randić, M. Pompe, D. Mills and S.C. Bašak, Variable connectivity index as a tool for modeling structure-property relationships, Molecules 9 (2004) 1177–1199.
  13. Randić, D. Plavšić and N. Lerš, Variable connectivity index for cycle-containing structures, J. Chem. Inf. Comput. Sci. 41 (3) (2001) 657–662.
  14. Randić, Novel graph theoretical approach to heteroatoms in quantitative structure-activity relationships, Chem. Intel. Lab. Syst. 10 (1991) 213–227.
  15. Randić, On computation of optimal parameters for multivariate analysis of structure-property relationship, J. Comput. Chem. 12 (1992) 970–980.
  16. Randić, On history of the Randić index and emerging hostility toward chemical graph theory, MATCH Commun. Math. Comput. Chem. 59 (2008) 5–124.
  17. Randić, On characterization of molecular branching, J. Am. Chem. Soc. 97 (1975) 6609–6615.
  18. Yousaf, A. A. Bhatti and A. Ali, On the minimum variable connectivity index of unicyclic graphs with a given order, Discrete Dyn. Nat. Soc. 2020 (2020) 1217567.
  19. Yousaf, A. A. Bhatti and A. Ali, Minimum variable connectivity index of trees of a fixed order, Discrete Dyn. Nat. Soc. 2020 (2020) 397627.
Iranian Journal of Mathematical Chemistry
Volume 13, Issue 1
March 2022
Pages 33-44

Files

Share

How to cite

Statistics