Overall connectivity - a next generation molecular connectivity

被引:37
作者
Bonchev, D
机构
[1] Texas A&M Univ, Dept Marine Sci, Galveston, TX 77551 USA
[2] Texas A&M Univ, Program Theory Complex Syst, Galveston, TX 77551 USA
关键词
overall connectivity; molecular connectivity; molecular complexity; QSPR/QSAR; alkanes;
D O I
10.1016/S1093-3263(01)00101-2
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
The development of molecular connectivity concept and some of its key elements - Randics inverse-square-root function and the detailed subgraph characterization - are analyzed. The concept of overall connectivity recently advanced is presented as a next step in unfolding the ideas of molecular connectivity by combining them with those of molecular complexity. Definitions of overall connectivity index, eth-order overall connectivities, and overall connectivity vector are presented along with formulae for calculating these sets of topological indices for several classes of graphs of chemical relevance. Based on sums of adjacencies over all subgraphs (or up to a limiting subgraph size in large molecules), the overall connectivities increase both with molecule size and complexity, as expressed in branching and cyclicity of molecular skeleton. When applied to molecules containing heteroatoms, valence overall connectivities are constructed employing the Kier and Hall scheme. The usefulness of the novel indices is demonstrated by modeling physicochemical properties of alkane compounds. A detailed comparison is made with other models derived for the same set of compounds, proceeding from molecular connectivity, as well as with two other probe connectivity functions - the overall connectivity versions of the second Zagreb index, and a derivative inverse function of this index. The favorable comparisons indicate the need of molecular connectivity paradigm revisiting, and show the potential of the overall connectivity indices for QSPR/QSAR applications. (C) 2001 Elsevier Science Inc. All rights reserved.
引用
收藏
页码:65 / 75
页数:11
相关论文
共 45 条
[41]  
RASHEVSKY N., 1955, BULL MATH BIOPHYS, V17, P229, DOI 10.1007/BF02477860
[42]   Walk counts, labyrinthicity, and complexity of acyclic and cyclic graphs and molecules [J].
Rücker, G ;
Rücker, C .
JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES, 2000, 40 (01) :99-106
[43]  
Shannon Claude, 1998, The Mathematical Theory of Communication
[44]  
SMOLENSKII EA, 1964, ZH FIZ KHIM+, V38, P1288
[45]  
STANKEVICH IV, 1995, THEOCHEM-J MOL STRUC, V342, P173