4.6 Article

Zagreb connection indices in structure property modelling

期刊

JOURNAL OF APPLIED MATHEMATICS AND COMPUTING
卷 69, 期 4, 页码 3005-3020

出版社

SPRINGER HEIDELBERG
DOI: 10.1007/s12190-023-01869-5

关键词

Topological index; Zagreb connection index; Molecular graph; Tree; Bipartite graph; QSPR analysis

向作者/读者索取更多资源

One of the major branches of mathematical chemistry, chemical graph theory, uses graph invariants to mathematically demonstrate chemical phenomena. Topological indices, numerical graph invariants derived from molecular graph representations, are used in structure-property modeling. Recently, the Zagreb connection indices have gained a lot of attention. The aim of this report is to reveal the chemical significance of these variants of Zagreb index and demonstrate their fascinating mathematical attributes. The chemical connection of the indices is examined through investigating their potential in structure-property modeling. Some crucial upper bounds for connection indices are computed to illustrate mathematical features, with characterization of maximal structures. Such characterization is extremely useful in regulating molecular properties predicted by the connection indices.
One of the major branches of mathematical chemistry is the chemical graph theory that employs graph invariants to demonstrate chemical phenomena mathematically. Topological indices are numerical graph invariants derived from molecular graph representations of chemical compounds that are used in structure-property modelling. In a brief span of time, the Zagreb connection indices have garnered a lot of attention. The ultimate goal of the present report is to reveal the chemical significance of this variants of Zagreb index and to demonstrate their fascinating mathematical attributes. The chemical connection of the indices is examined by investigating their potential in structure-property modelling. To illustrate mathematical features, some crucial upper bounds for connection indices are computed with characterizing maximal structures. The maximal graphs for the class of connected, tree, bipartite and chain graphs are identified by means of connection indices in terms of graph order. Such characterization is quite useful in regulating molecular properties that the connection indices can predict.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据