Bounds for the Atom-Bond Sum-Connectivity Index of Graphs
The atom-bond sum-connectivity (ABSC) index of a graph G is defined asdu+dv , where du and dv represent the degrees of u and v in G, respectively.In this paper, we give some sharp bounds for the ABSC index in terms of the first Zagreb index, the harmonic index, the sum-connectivity index, the minimum and maximum degrees, the clique number, and the chromatic number.We also find a lower bounds for the ABSC index of trees with given number of vertices and maximum degree.
Authors
- Zaryab Hussain (ORCID: https://orcid.org/0000-0002-9218-7735)
- Hongbo Hua
- Hechao Liu (ORCID: https://orcid.org/0000-0001-7606-4842)
Publication Details
- Journal
- match Communications in Mathematical and in Computer Chemistry
- Published
- 2025-01-01
- DOI
- https://doi.org/10.46793/match94-3.08524
- Citations
- 1
- Primary Topic
- Graph theory and applications
- Type
- article
- Field-Weighted Citation Impact
- 4.09
Funders
- Hubei Provincial Department of Education
- Natural Science Foundation of Hubei Province