The ABC Index Conundrum's Complete Solution

IF 2.9 2区化学 Q2 CHEMISTRY, MULTIDISCIPLINARY

Match-Communications in Mathematical and in Computer Chemistry Pub Date : 2023-10-01 DOI:10.46793/match.91-1.005d

Darko Dimitrov, Zhibin Du

引用次数: 0

Abstract

The problem of complete characterization of trees with minimal atom-bond-connectivity index (minimal-ABC trees) has a reputation as one of the most challenging and intriguing open problems in mathematical chemistry. Recently, the problem has been completely solved. Here, we provide an overview of the key results that led to its complete solution.

查看原文本刊更多论文

ABC指数难题的完整解决方案

具有最小原子键连通性指数的树(最小abc树)的完全表征问题是数学化学中最具挑战性和最有趣的开放问题之一。最近，这个问题已经完全解决了。在这里，我们概述了导致其完整解决方案的关键结果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Match-Communications in Mathematical and in Computer Chemistry 化学-化学综合

CiteScore

4.40

自引率

26.90%

发文量

审稿时长

2 months

期刊介绍： MATCH Communications in Mathematical and in Computer Chemistry publishes papers of original research as well as reviews on chemically important mathematical results and non-routine applications of mathematical techniques to chemical problems. A paper acceptable for publication must contain non-trivial mathematics or communicate non-routine computer-based procedures AND have a clear connection to chemistry. Papers are published without any processing or publication charge.