The ABC Index Conundrum's Complete Solution
-
Published:2023-10
Issue:1
Volume:91
Page:5-38
-
ISSN:0340-6253
-
Container-title:Match - Communications in Mathematical and in Computer Chemistry
-
language:
-
Short-container-title:MATCH
Author:
Dimitrov Darko, ,Du Zhibin,
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.
Publisher
University Library in Kragujevac
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Science Applications,General Chemistry
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献