Literature DB >> 16920663

Complexity of chemical graphs in terms of size, branching, and cyclicity.

A T Balaban1, D Mills, V Kodali, S C Basak.   

Abstract

Chemical graph complexity depends on many factors, but the main ones are size, branching, and cyclicity. Some molecular descriptors embrace together all these three parameters, which cannot then be disentangled. The topological index J (and its refinements that include accounting for bond multiplicity and the presence of heteroatoms) was designed to compensate in a significant measure for graph size and cyclicity, and therefore it contains information mainly on branching. In order to separate these factors, two new indices (F and G) related with J are proposed, which allow to group together graphs with the same size into families of constitutional formulas differing in their branching and cyclicity. A comparison with other topological indices revealed that a few other topological indices vary similarly with index G, notably DN2S4 among the triplet indices, and TOTOP among the indices contained in the Molconn-Z program. This comparison involved all possible chemical graphs (i.e. connected planar graphs with vertex degrees not higher than four) with four through six vertices, and all possible alkanes with four through nine carbon atoms.

Entities:  

Mesh:

Substances:

Year:  2006        PMID: 16920663     DOI: 10.1080/10629360600884421

Source DB:  PubMed          Journal:  SAR QSAR Environ Res        ISSN: 1026-776X            Impact factor:   3.000


  5 in total

1.  Can topological indices transmit information on properties but not on structures?

Authors:  Alexandru T Balaban
Journal:  J Comput Aided Mol Des       Date:  2005-11-23       Impact factor: 3.686

2.  The importance of molecular complexity in the design of screening libraries.

Authors:  Shahul H Nilar; Ngai Ling Ma; Thomas H Keller
Journal:  J Comput Aided Mol Des       Date:  2013-09       Impact factor: 3.686

3.  Structural discrimination of networks by using distance, degree and eigenvalue-based measures.

Authors:  Matthias Dehmer; Martin Grabner; Boris Furtula
Journal:  PLoS One       Date:  2012-07-06       Impact factor: 3.240

4.  Discrimination Power of Polynomial-Based Descriptors for Graphs by Using Functional Matrices.

Authors:  Matthias Dehmer; Frank Emmert-Streib; Yongtang Shi; Monica Stefu; Shailesh Tripathi
Journal:  PLoS One       Date:  2015-10-19       Impact factor: 3.240

5.  The discrimination power of structural SuperIndices.

Authors:  Matthias Dehmer; Abbe Mowshowitz
Journal:  PLoS One       Date:  2013-07-25       Impact factor: 3.240

  5 in total

北京卡尤迪生物科技股份有限公司 © 2022-2023.