arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2110.14712math.CO
收藏

极小ABC树的完全刻画

Complete characterization of the minimal-ABC trees

Darko Dimitrov, Zhibin Du

摘要:

用最小原子键连接指数表征树(最小ABC树)的问题是数学化学中最近最苛刻的开放最优化问题之一。在这里,首先,我们给出了一个肯定的答案的猜想,这表明,足够大的最小ABC树是由唯一的根顶点和所谓的$D_z$ -和$D_{z+1}$ -分支。基于本文给出的理论结果和一些已知的结果,我们得到了足够的约束条件来减少搜索空间,解决了最优化问题,从而精确地确定了任意阶的极小ABC树.

英文摘要:

The problem of characterizing trees with minimal atom-bond-connectivity index (minimal-ABC trees) has a reputation as one of the most demanding recent open optimization problems in mathematical chemistry. Here firstly, we give an affirmative answer to the conjecture, which states that enough large minimal-ABC trees are comprised solely of a root vertex and so-called $D_z$- and $D_{z+1}$-branches. Based on the presented theoretical results here and some already known results, we obtain enough constraints to reduce the search space and solve the optimization problem, and thus, determine exactly the minimal-ABC trees of a given arbitrary order.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑