On the atom-bond connectivity index and radius of connected graphs
From MaRDI portal
Publication:259638
DOI10.1186/S13660-015-0714-4zbMath1333.05092OpenAlexW1955487970WikidataQ59434933 ScholiaQ59434933MaRDI QIDQ259638
Publication date: 17 March 2016
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-015-0714-4
Extremal problems in graph theory (05C35) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Related Items (6)
Complete characterization of the minimal-ABC trees ⋮ Some forbidden combinations of branches in minimal-ABC trees ⋮ Inequalities between degree- and distance-based graph invariants ⋮ The ABC Index Conundrum's Complete Solution ⋮ A solution of the conjecture about big vertices of minimal-ABC trees ⋮ Atom–bond connectivity index of graphs: a review over extremal results and bounds
Cites Work
- Unnamed Item
- Some upper bounds for the atom-bond connectivity index of graphs
- Further results on atom-bond connectivity index of trees
- On atom-bond connectivity index of connected graphs
- Atom-bond connectivity index of graphs
- Atom-bond connectivity index of trees
- Some inequalities for the atom-Bond connectivity index of graph operations
- The ABC index conundrum
This page was built for publication: On the atom-bond connectivity index and radius of connected graphs