SavedAdd your journal

Journals / Hacettepe Journal of Mathematics and Statistics / 2018 / Cilt: 47 - Sayı: 5

Distance property of chemical graphs

Hafiz Muhammad UMAİR
Shaohui WANG
Sakander HAYAT
Shahzad AHMAD
Pages
1071–1093
Publication Date
2022-10-18
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

These topological indices can be obtained as a by-product of our technique.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:We have developed a rigorous computational technique to compute exact analytic expressions for a number of distance-based topological indices of chemical graphs.
📊
Key Findings & Data:There are two main advantages of our technique over existing techniques of similar nature: first, our technique is significantly diverse as it also covers the Wiener index and eccentricity-based topological indices besides Szeged-like indices, and secondly we have considerably reduced the algorithmic and computational complexity in comparison to previous techniques.
💡
Conclusion & Impact:These topological indices can be obtained as a by-product of our technique.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Combinatorial algorithms · Distance-based topological indices · Eccentricity-based topological indices

Abstract

We have developed a rigorous computational technique to compute exact analytic expressions for a number of distance-based topological indices of chemical graphs. There are two main advantages of our technique over existing techniques of similar nature: first, our technique is significantly diverse as it also covers the Wiener index and eccentricity-based topological indices besides Szeged-like indices, and secondly we have considerably reduced the algorithmic and computational complexity in comparison to previous techniques. Our proposed technique generates certain vertex and edge partitions of a graph which are essential in computing the exact analytical formulas of distance-based and eccentricity-based indices. To ensure the applicability of our technique,we have computed various distance-based and eccentricity-based topological indices for certain infinite families of polyomino chain system. Moreover, we find analytical exact expressions of certain degree-based topological indices for these polyomino chains. These topological indices can be obtained as a by-product of our technique.

🔖

Cite This Article

UMAİR, H. M., WANG, S., HAYAT, S., AHMAD, S. (2022). Distance property of chemical graphs. Hacettepe Journal of Mathematics and Statistics, Cilt: 47 - Sayı: 5, 1071–1093. https://ajindex.com/articles/529828

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (20)

  1. Ashrafi, A.R. Doslic, T. and Saheli, M. The eccentric connectivity index of $TUC_4C_8(R)$ nanotubes, MATCH Commun. Math. Comput. Chem. 65, 221-230, 2011.
  2. Ashrafi, A.R. Ghorbani, M. and Jalali, M. The $PI$ and edge Szeged polynomials of an infinitefamily of fullerenes, Fullerenes, Nanotubes and Carbon Nanostructures 18 (3), 107-116,2010.
  3. Aouchiche, M. and Hansen, P. On a conjecture about the Szeged index, European J. Combin. 31, 1662-1666, 2010.
  4. Arockiaraj M. Kavithah, S.R.J. and Balasubramanian, K. Vertex-cut methods for distance- based topological indices and its application to inorganic networks, J. Math. Chem. 54, 1728-1747, 2016.
  5. Baca, M. Horváthová, J. Mokrisová, M. and Suhányiová, A. On topological indices of fullerenes, Appl. Math. Comput. 251, 154-161, 2015.
  6. Imran, M. and Hayat, S. On counting polynomials of certain polyomino chains, Bulg. Chem. Commun. 48, 332-337, 2016.
  7. Diudea, M.V. Nanomolecules and nanostructures: polynomials and indices, University of Kragujevac, Kragujevac, 2010.
  8. Diudea, M.V. Ursu O. and Nagy, Cs.L. TOPOCLUJ, Babes-Bolyai University, Cluj, 2002.
  9. Dureja, H. and Madan, A.K. Superaugmented eccentric connectivity indices: new-generationhighly discriminating topological descriptors for $QSAR/QSPR$ modeling, Med. Chem. Res.16, 331-341, 2007.
  10. Eliasi, M. and Taeri, B. Szeged index of armchair polyhex nanotubes, MATCH Commun. Math. Comput. Chem., 59 437-450, 2008.
  11. Estrada, E. Torres, L. Rodríguez, L. and Gutman, I. An atom-bond connectivity index: Modelling the enthalpy of formation of alkanes, Indian J. Chem., 37A, 849-855, 1998.
  12. The GAP Team, GAP, Groups, Algorithms and Programming, Lehrstuhl De fur Mathematik, RWTH, Aachen, 1992.
  13. Golomb, S.W. Polyominoes, Princeton University Press,
  14. Princeton, New Jersey, 1994.
  15. Graovac A. Ghorbani, M. and Hosseinzadeh, M.A. Computing fifth geometric-arithmetic index for nanostar dendrimers, J. Math. Nanosci. 1, 33-42, 2011.
  16. Graovac, A. and Hosseinzadeh, M.A. Computing $ABC_4$ index of nanostar dendrimers, Optoelectron.Adv. Mater. Rapid Commun. 4, 1419-1422, 2010.
  17. Graovac, A. Ori, O. Faghani, M. and Ashrafi, A.R. Distance property of fullerenes, Iranian J. Math. Chem. 1, 5-15, 2010.
  18. Gutman, I. A formula for the Wiener number of trees and its extension to graphs containing cycles, Graph Theory Notes New York, 27, 9-15, 1994.
  19. Gutman, I. and Dobrynin, A.A. The Szeged index - a success story, Graph Theory Notes New York 34, 37-44, 1998.
  20. Hayat, S. and Imran, M. Computation of topological indices of certa