Remarks on maximum atom-bond connectivity index with given graph parameters
DOI10.1016/J.DAM.2017.01.019zbMATH Open1396.05110arXiv1610.02574OpenAlexW2590186269MaRDI QIDQ1786889FDOQ1786889
Authors: Darko Dimitrov, Barbara Ikica, Riste Škrekovski
Publication date: 25 September 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.02574
Recommendations
- Maximum atom-bond connectivity index with given graph parameters
- Solution to a conjecture on the maximum ABC index of graphs with given chromatic number
- The maximum atom-bond connectivity index for graphs with edge-connectivity one
- On atom-bond connectivity index of connected graphs
- Some upper bounds for the atom-bond connectivity index of graphs
Applications of graph theory (05C90) Vertex degrees (05C07) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Cites Work
- Computer search for trees with minimal ABC index
- On structural properties of trees with minimal atom-bond connectivity index
- On structural properties of trees with minimal atom-bond connectivity index. II: Bounds on \(B_1\)- and \(B_2\)-branches
- Efficient computation of trees with minimal atom-bond connectivity index
- Title not available (Why is that?)
- Disproving a conjecture on trees with minimal atom-bond connectivity index
- Fast computer search for trees with minimal ABC index based on tree degree sequences
- Title not available (Why is that?)
- Some upper bounds for the atom-bond connectivity index of graphs
- Extreme atom-bond connectivity index of graphs
- The ABC index conundrum
- Further results on atom-bond connectivity index of trees
- On atom-bond connectivity index of connected graphs
- Atom-bond connectivity index of graphs
- ABC index of trees with fixed number of leaves
- On structural properties of trees with minimal atom-bond connectivity index. III: Trees with pendent paths of length three
- Maximum atom-bond connectivity index with given graph parameters
- Mathematical aspects of fullerenes
- On trees with minimal ABC index among trees with given number of leaves
- The smallest ABC index of trees with \(n\) pendent vertices
- Comparison between atom-bond connectivity indices of graphs
- On a family of trees with minimal atom-bond connectivity index
- Parallel search trees with minimal ABC index with MPI+OpenMP
- Atom-bond connectivity index versus Graovac-Ghorbani analog
- Mathematical aspects of Wiener index
- New upper bounds for the ABC index
- Remarks on the Graovac-Ghorbani index of bipartite graphs
Cited In (17)
- Maximum external Wiener index of graphs
- The minimal-ABC trees with \(B_2\)-branches
- Solution to a conjecture on the maximum ABC index of graphs with given chromatic number
- A Survey on Graovac–Ghorbani Index
- On the maximum ABC index of graphs without pendent vertices
- On a relation between the atom-bond connectivity index and the chromatic number
- A solution of the conjecture about big vertices of minimal-ABC trees
- On large ABC spectral radii of unicyclic graphs
- The greatest values for atom-bond sum-connectivity index of graphs with given parameters
- The ABC Index Conundrum's Complete Solution
- Maximum atom-bond connectivity index with given graph parameters
- Complete characterization of the minimal-ABC trees
- Some forbidden combinations of branches in minimal-ABC trees
- On structural properties of trees with minimal atom-bond connectivity index. IV: solving a conjecture about the pendent paths of length three
- The maximum atom-bond connectivity index for graphs with edge-connectivity one
- Atom–bond connectivity index of graphs: a review over extremal results and bounds
- On extremality of ABC spectral radius of a tree
This page was built for publication: Remarks on maximum atom-bond connectivity index with given graph parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1786889)