On the Difference of Atom-Bond Sum-Connectivity and Atom-Bond-Connectivity Indices
Akbar Ali, Ivan Gutman, Izudin Redzepovic, Jaya Percival Mazorodze,, Abeer M. Albalahi, Amjad E. Hamza

TL;DR
This paper investigates the difference between the atom-bond sum-connectivity (ABS) and atom-bond connectivity (ABC) indices, showing positivity under certain conditions and computing differences for small trees.
Contribution
It establishes the positivity of the ABS-ABC difference for specific classes of graphs and line graphs, and provides computational data for small trees.
Findings
ABS-ABC is positive for graphs with minimum degree ≥ 2.
The difference is positive for line graphs of certain graphs, excluding paths and cycles.
Computed differences for all trees up to order 15.
Abstract
The atom-bond-connectivity (ABC) index is one of the well-investigated degree-based topological indices. The atom-bond sum-connectivity (ABS) index is a modified version of the ABC index, which was introduced recently. The primary goal of the present paper is to investigate the difference between the aforementioned two indices, namely . It is shown that the difference is positive for all graphs of minimum degree at least as well as for all line graphs of those graphs of order at least that are different from the path and cycle graphs. By means of computer search, the difference is also calculated for all trees of order at most .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Graphene research and applications · Carbon Nanotubes in Composites
