Maximum values of atom-bond connectivity index in the class of tetracyclic graphs
From MaRDI portal
Publication:741399
DOI10.1007/S12190-013-0749-YzbMATH Open1297.05129OpenAlexW2154082201WikidataQ61987596 ScholiaQ61987596MaRDI QIDQ741399FDOQ741399
Authors: T. Dehghan-Zadeh, N. Habibi, A. R. Ashrafi
Publication date: 12 September 2014
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-013-0749-y
Cites Work
- Some inequalities for the atom-Bond connectivity index of graph operations
- Notes on trees with minimal atom-bond connectivity index
- Extremal trees with fixed degree sequence for atom-bond connectivity index
- Some upper bounds for the atom-bond connectivity index of graphs
- Extreme 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
Cited In (5)
- Maximum values of atom-bond connectivity index in the class of tricyclic graphs
- On the maximum ABC index of graphs without pendent vertices
- Extremal tetracyclic graphs with respect to the first and second Zagreb indices
- On the extremal graphs with respect to bond incident degree indices
- Atom–bond connectivity index of graphs: a review over extremal results and bounds
This page was built for publication: Maximum values of atom-bond connectivity index in the class of tetracyclic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q741399)