On the Concept for Overall Topological Representation of Molecular Structure
- By Danail Bonchev1
-
View Affiliations Hide Affiliations1 Center for the Study of Biological Complexity, Virginia Commonwealth University, P.O.BOX 842030, Richmond, VA 23284, United States
- Source: Advances in Mathematical Chemistry and Applications: Volume 1 Revised Edition , pp 42-75
- Publication Date: October 2015
- Language: English
On the Concept for Overall Topological Representation of Molecular Structure, Page 1 of 1
< Previous page | Next page > /docserver/preview/fulltext/9781681081977/chapter-3-1.gif
Graph theory based descriptors of molecular structure play important role in QSPR/ QSAR models. This chapter reviews some attempts to optimize the characterization of molecular structure via an integrated representation that accounts in a systemic manner for the contributions of all substructures. In its simplest version this approach counts the subgraphs of all sizes, the resulted single number being shown to be a very sensitive measure of structural complexity. The most complete version builds (i) an ordered set of counts of subgraphs of increasing number of edges, (ii) weights each subgraph with the value of selected graph-invariant, building a weighted ordered set, and (iii) sums up all the subgraph contributions to produce the overall value of the graph-invariant. The invariants tested include vertex degrees, vertex distances, and the graph non-adjacency numbers, the corresponding overall topological indices being called overall connectivity, overall Wiener, overall Zagreb and overall Hosoya indices. Their properties are analyzed in detail in acyclic and cyclic graphs. It is shown that they all are reliable measures of molecular structural complexity, increasing in value with the basic complexifying patterns of branching and cyclicity of molecular skeleton. The structure-property models derived for 10 physicochemical properties of alkane compounds show considerable improvement compared to models derived from molecular connectivity indices. The latest extension of these ideas is demonstrated with extended connectivities, walk counts, and Bourgas indices, the latter of which are the first integrated measures of graph complexity and vertex centrality.
-
From This Site
/content/books/9781681081977.chapter-3dcterms_subject,pub_keyword-contentType:Journal -contentType:Figure -contentType:Table -contentType:SupplementaryData105