Computer search for large trees with minimal ABC index

Wenshui Lin, Jianfeng Chen, Zhixi Wu, Darko Dimitrov and Linshan Huang

Applied Mathematics and Computation, 2018, vol. 338, issue C, 221-230

Abstract: The atom-bond connectivity (ABC) index of a graph G = (V, E) is defined as ABC(G)=∑vivj∈E(di+dj−2)/(didj), where V = {v0,v1,⋅⋅⋅, vn − 1} and di denotes the degree of vertex vi of G. This molecular structure descriptor found interesting applications in chemistry, and has become one of the most actively studied vertex-degree-based graph invariants. However, the problem of characterizing n-vertex tree(s) with minimal ABC index remains open and was coined as the “ABC index conundrum”. In attempts to guess the general structure of such trees, several computer search algorithms were developed and tested up to n = 800. However, for large n, all current search programs seem too powerless. For example, the fastest one up to date reported recently in [30] costs 2.2 h for n = 800 on a single PC with two CPU cores. In this paper, we significantly refine the known features of the degree sequence of a tree with minimal ABC index. With the refined features a search program was implemented with OpenMP. Our program was tested on a single PC with 4 CPU cores, and identified all n-vertex tree(s) with minimal ABC index up to n = 1100 within 207.1 h. Some observations are made based on the search results, which indicate some possible directions in further investigation of the problem of characterizing n-vertex tree(s) with minimal ABC index.

Keywords: Atom-bond connectivity index; Trees; Extremal graphs; Computer search (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318305009
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:338:y:2018:i:c:p:221-230

DOI: 10.1016/j.amc.2018.06.012

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().