{"title":"The ABC Index Conundrum's Complete Solution","authors":"Darko Dimitrov, Zhibin Du","doi":"10.46793/match.91-1.005d","DOIUrl":null,"url":null,"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.","PeriodicalId":51115,"journal":{"name":"Match-Communications in Mathematical and in Computer Chemistry","volume":"67 1","pages":"0"},"PeriodicalIF":2.9000,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Match-Communications in Mathematical and in Computer Chemistry","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.46793/match.91-1.005d","RegionNum":2,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 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.
期刊介绍：
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
