 On structural properties of trees with minimal atom-bond connectivity index III: Trees with pendent paths of length threeDarko Dimitrov, Zhibin Du and Carlos M. da Fonseca Applied Mathematics and Computation, 2016, vol. 282, issue C, 276-290 Abstract: The atom-bond connectivity (ABC) index is a degree-based graph topological index that found chemical applications, including those of predicting the stability of alkanes and the strain energy of cycloalkanes. Several structural properties of the trees with minimal ABC index were proved recently, however the complete characterization of the minimal-ABC trees is still an open problem. It is known that minimal-ABC trees can have at most one pendent path of length 3. It is also known that the minimal-ABC trees that have a pendent path of length 3 do not contain so-called Bk-branches, with k ≥ 4, and do not contain more than two B2-branches. Here, we improve the latter result by showing that minimal-ABC trees of order larger than 168 and with a pendent path of length 3 do not contain B2-branches. Moreover, we show that trees with minimal ABC index with a pendent path of length 3 do not contain B1-branches. Keywords: Atom-bond connectivity index; Topological indices; Extremal graphs; Chemical applications (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:282:y:2016:i:c:p:276-290 DOI: 10.1016/j.amc.2016.02.019 Access Statistics for this article Applied Mathematics and Computation is currently edited by Theodore Simos More articles in Applied Mathematics and Computation from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.