EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

On the Difference between Bond Additive Indices and Their Edge Versions

Liju Alex, Muhammad Imran

match Communications in Mathematical and in Computer Chemistry · 10.03.2026 · 2 (96) · 753

DOI: 10.46793/match.96-2.19725 ↗

Kurz gefasst

Fachartikel in der Zeitschrift match Communications in Mathematical and in Computer Chemistry, online erschienen am 10.03.2026. Verfasst von Liju Alex und 1 weiteren Autor:innen. Die Arbeit nennt 27 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Bond additive indices are a special class of topological indices (TI) that are determined by the sum of the edge contributions of graphs. The Szeged index, PI index, Mostar index, and their edge versions are among the most extensively studied bond additive indices. In this paper, we investigate the difference between bond additive indices and their respective edge versions, denoted by ∆TI. Specifically, we study this problem for the Szeged index, PI index, and Mostar index. We obtain upper and lower bounds for ∆TI for different classes of graphs such as trees, unicyclic graphs, and bicyclic graphs, and identify the graphs that attain these bounds. Furthermore, we characterize the graphs that satisfy the property ∆TI =0 within these graph classes.

Zitieren

APA

Alex, L., & Imran, M. (2026). On the Difference between Bond Additive Indices and Their Edge Versions. match Communications in Mathematical and in Computer Chemistry, 2(96), 753. https://doi.org/10.46793/match.96-2.19725

Vancouver

Alex L, Imran M. On the Difference between Bond Additive Indices and Their Edge Versions. match Communications in Mathematical and in Computer Chemistry. 2026;2(96):753. doi:10.46793/match.96-2.19725

BibTeX
@article{Alex2026,
  author = {Alex, Liju and Imran, Muhammad},
  title = {On the Difference between Bond Additive Indices and Their Edge Versions},
  journal = {match Communications in Mathematical and in Computer Chemistry},
  year = {2026},
  volume = {2},
  number = {96},
  pages = {753},
  doi = {10.46793/match.96-2.19725}
}
Kostenlos starten →