Bounds for the atom-bond sum-connectivity index of graphs
preprint
OA: closed
CC-BY-4.0
Abstract
The atom-bond sum-connectivity (ABSC) index of a graph G is defined as ABSC(G) = uv∈E(G) du+dv−2 du+dv , where d u and d v represent the degrees of u and v in G, respectively. In this paper, we give some sharp bounds for the ABSC index in term of the first Zagreb index, the harmonic index, the sum-connectivity index, the minimum and maximum degrees, the clique number, and the chromatic number. In particular, we find lower bounds of the ABSC index for trees with given number of vertices and maximum degree ∆. 2020 Mathematics Subject Classification: 05C05, 05C09, 05C92.
My notes (saved in your browser only)
Citation neighborhood (no data yet)
We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.
Source provenance
- europepmc
- last seen: 2026-05-19T01:45:01.086888+00:00
- unpaywall
- last seen: 2026-05-24T02:00:01.246996+00:00
License: CC-BY-4.0