The evolution of the structure of ABC-minimal trees

DOI10.1016/J.JCTB.2021.07.001zbMATH Open1478.05026arXiv1804.02098OpenAlexW3186192875MaRDI QIDQ2664562FDOQ2664562

Seyyed Aliasghar Hosseini, Bojan Mohar, Mohammad Bagher Ahmadi

Publication date: 17 November 2021

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Abstract: The atom-bond connectivity (ABC) index is a degree-based molecular descriptor that found diverse chemical applications. Characterizing trees with minimum ABC-index remained an elusive open problem even after serious attempts and is considered by some as one of the most intriguing open problems in mathematical chemistry. In this paper, we describe the exact structure of the extremal trees with sufficiently many vertices and we show how their structure evolves when the number of vertices grows. An interesting fact is that their radius is at most~$5$ and that all vertices except for one have degree at most 54. In fact, all but at most $O(1)$ vertices have degree 1, 2, 4, or 53. Let $gamm{a}_n=minabc(T):Textisatreeofordern$. It is shown that $gamm{a}_n=frac1365sqrtfrac153Bigl(1+26sqrt55+156sqrt106Bigr)n+O(1)approx0.67737178,n+O(1)$.

Full work available at URL: https://arxiv.org/abs/1804.02098

zbMATH Keywords

topological indexABC indexmathematical chemistryatom bond connectivity

Mathematics Subject Classification ID

Trees (05C05) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Extremal problems in graph theory (05C35) Connectivity (05C40) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The atom-bond connectivity index of catacondensed polyomino graphs
• 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
• Notes on trees with minimal atom-bond connectivity index
• Trees with smallest atom-bond connectivity index
• The ABC index of trees with given degree sequence
• Extremal trees with fixed degree sequence for atom-bond connectivity index
• The atom-bond connectivity index of benzenoid systems and phenylenes
• The ABC index conundrum
• Further results on atom-bond connectivity index of trees
• Atom-bond connectivity index of graphs
• Atom-bond connectivity index of trees
• Laplacian energy of a graph
• The extremal values of the Wiener index of a tree with given degree sequence
• On structural properties of trees with minimal atom-bond connectivity index. III: Trees with pendent paths of length three
• The minimal-ABC trees with \(B_2\)-branches
• On a family of trees with minimal atom-bond connectivity index
• 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
• Computer search for large trees with minimal \(\mathrm{ABC}\) index

Cited In (11)

• Extremal results and bounds for atom-bond sum-connectivity index
• Bond incident degree indices of connected \((n, m)\)-graphs with fixed maximum degree
• Open problem on the maximum exponential augmented Zagreb index of unicyclic graphs
• On general \(A B C\)-type index of connected graphs
• The ABC Index Conundrum's Complete Solution
• Complete characterization of the minimal-ABC trees
• Trees with minimum weighted Szeged index
• On ABC spectral radius of uniform hypergraphs
• On bond incident degree index of chemical trees with a fixed order and a fixed number of leaves
• Study on geometric-arithmetic, arithmetic-geometric and Randić indices of graphs
• Extremal augmented Zagreb index of trees with given numbers of vertices and leaves

Recommendations

• The minimal-ABC trees with \(B_2\)-branches 👍 👎
• The structure of ABC-minimal trees with given number of leaves 👍 👎
• On the minimal ABC index of trees with \(k\) leaves 👍 👎
• Some upper bounds for minimal trees 👍 👎
• Complete characterization of the minimal-ABC trees 👍 👎
• The combinatorics of evolutionary trees---a survey 👍 👎
• A solution of the conjecture about big vertices of minimal-ABC trees 👍 👎
• On structural properties of ABC-minimal chemical trees 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: The evolution of the structure of ABC-minimal trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2664562)