On Extremal Graphs with Respect to the Atom-Bond Sum Connectivity Index
Match Communications in Mathematical and in Computer Chemistry · 27.04.2026 · 3 (96) · 1079
DOI: 10.46793/match.96-3.32825 ↗Kurz gefasst
Fachartikel in der Zeitschrift Match Communications in Mathematical and in Computer Chemistry, online erschienen am 27.04.2026. Verfasst von Swathi Shetty und 2 weiteren Autor:innen. Die Arbeit nennt 9 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Recently, Ali et al. [1] posed several open problems concerning extremal graphs with respect to the atom-bond sum connectivity in-dex. These problems involve characterizing graphs that attain the maximum ABS index within specific graph classes, including: (i) connected graphs with n vertices and p cut-vertices; (ii) connected graphs of order n with vertex k-partiteness vk(G) = r; and (iii) connected bipartite graphs of order n with a fixed vertex connectiv-ity κ. In this paper, we provide complete solutions to all of these problems.
Zitieren
APA
Shetty, S., Rakshith, B. R., & Sayinath, U. N. V. (2026). On Extremal Graphs with Respect to the Atom-Bond Sum Connectivity Index. Match Communications in Mathematical and in Computer Chemistry, 3(96), 1079. https://doi.org/10.46793/match.96-3.32825
Vancouver
Shetty S, Rakshith BR, Sayinath UNV. On Extremal Graphs with Respect to the Atom-Bond Sum Connectivity Index. Match Communications in Mathematical and in Computer Chemistry. 2026;3(96):1079. doi:10.46793/match.96-3.32825
BibTeX
@article{Shetty2026,
author = {Shetty, Swathi and Rakshith, Billava Ramanna and Sayinath, Udupa Nagara Vinayaka},
title = {On Extremal Graphs with Respect to the Atom-Bond Sum Connectivity Index},
journal = {Match Communications in Mathematical and in Computer Chemistry},
year = {2026},
volume = {3},
number = {96},
pages = {1079},
doi = {10.46793/match.96-3.32825}
}
EUVIMED