Efficient computation of trees with minimal atom-bond connectivity index
From MaRDI portal
Publication:279056
DOI10.1016/j.amc.2013.08.089zbMath1334.05163arXiv1305.1155OpenAlexW2092910538MaRDI QIDQ279056
Publication date: 27 April 2016
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1305.1155
Related Items (24)
On structural properties of trees with minimal atom-bond connectivity index. II: Bounds on \(B_1\)- and \(B_2\)-branches ⋮ Solution to a conjecture on the maximum ABC index of graphs with given chromatic number ⋮ On the maximal general ABC index of graphs with given maximum degree ⋮ On connected graphs and trees with maximal inverse sum indeg index ⋮ The evolution of the structure of ABC-minimal trees ⋮ Some forbidden combinations of branches in minimal-ABC trees ⋮ A Survey on Graovac–Ghorbani Index ⋮ The ABC Index Conundrum's Complete Solution ⋮ On structural properties of trees with minimal atom-bond connectivity index ⋮ Further properties of trees with minimal atom-bond connectivity index ⋮ On structural properties of trees with minimal atom-bond connectivity index. III: Trees with pendent paths of length three ⋮ Remarks on the Graovac-Ghorbani index of bipartite graphs ⋮ On structural properties of trees with minimal atom-bond connectivity index. IV: solving a conjecture about the pendent paths of length three ⋮ On the maximum ABC index of graphs without pendent vertices ⋮ A solution of the conjecture about big vertices of minimal-ABC trees ⋮ On the minimal ABC index of trees with \(k\) leaves ⋮ On large ABC spectral radii of unicyclic graphs ⋮ Remarks on maximum atom-bond connectivity index with given graph parameters ⋮ On structural properties of ABC-minimal chemical trees ⋮ On a family of trees with minimal atom-bond connectivity index ⋮ On atom bond connectivity index of some molecular graphs ⋮ Computer search for large trees with minimal \(\mathrm{ABC}\) index ⋮ Edge-version atom-bond connectivity and geometric arithmetic indices of generalized bridge molecular graphs ⋮ Atom–bond connectivity index of graphs: a review over extremal results and bounds
Uses Software
This page was built for publication: Efficient computation of trees with minimal atom-bond connectivity index
