On atom bond sum connectivity index of chemical unicyclic graphs with a perfect matching
Filomat · 2025 · 39 (29) · 10503-10518
DOI: 10.2298/fil2529503d ↗Kurz gefasst
Fachartikel in der Zeitschrift Filomat, 2025. Verfasst von Jianwei Du und 2 weiteren Autor:innen. Die Arbeit nennt 19 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC0).
Abstract (Originalsprache)
The atom bond sum connectivity (ABS) index of a graph Γ = (V(Γ), E(Γ)) is formulated by ABS(\Gamma) = \sum_{xy \in E(\Gamma)} \sqrt{\frac{d_{\Gamma}(x) + d_{\Gamma}(y) - 2}{d_{\Gamma}(x) + d_{\Gamma}(y)}}, where dΓ(x) denotes the degree of vertex x in Γ. In this work, we determine the maximum value of atom bond sum connectivity index of chemical unicyclic graphs with a perfect matching and identify the corresponding extremal graphs. Our discoveries extend the results of the recent paper [Wang et al., MATCH Commun. Math. Comput. Chem. 92 (2024) 653-669] from chemical trees with a perfect matching to chemical unicyclic graphs with a perfect matching.
Zitieren
APA
Du, J., Sun, X., & Mei, Y. (2025). On atom bond sum connectivity index of chemical unicyclic graphs with a perfect matching. Filomat, 39(29), 10503-10518. https://doi.org/10.2298/fil2529503d
Vancouver
Du J, Sun X, Mei Y. On atom bond sum connectivity index of chemical unicyclic graphs with a perfect matching. Filomat. 2025;39(29):10503-10518. doi:10.2298/fil2529503d
BibTeX
@article{Du2025,
author = {Du, Jianwei and Sun, Xiaoling and Mei, Yinzhen},
title = {On atom bond sum connectivity index of chemical unicyclic graphs with a perfect matching},
journal = {Filomat},
year = {2025},
volume = {39},
number = {29},
pages = {10503--10518},
doi = {10.2298/fil2529503d}
}
EUVIMED