Four New Topological Indices Based on the Molecular Path Code (original) (raw)
2007, Journal of Chemical Information and Modeling
The sequence of all paths p i of lengths i) 1 to the maximum possible length in a hydrogen-depleted molecular graph (which sequence is also called the molecular path code) contains significant information on the molecular topology, and as such it is a reasonable choice to be selected as the basis of topological indices (TIs). Four new (or five partly new) TIs with progressively improved performance (judged by correctly reflecting branching, centricity, and cyclicity of graphs, ordering of alkanes, and low degeneracy) have been explored. (i) By summing the squares of all numbers in the sequence one obtains Σ i p i 2 , and by dividing this sum by one plus the cyclomatic number, a Quadratic TI is obtained: Q) Σ i p i 2 /(µ+1). (ii) On summing the Square roots of all numbers in the sequence one obtains Σ i p i 1/2 , and by dividing this sum by one plus the cyclomatic number, the TI denoted by S is obtained: S) Σ i p i 1/2 /(µ+1). (iii) On dividing terms in this sum by the corresponding topological distances, one obtains the Distance-reduced index D) Σ i {p i 1/2 /[i(µ+1)]}. Two similar formulas define the next two indices, the first one with no square roots: (iv) distance-Attenuated index: A) Σ i {p i /[i(µ + 1)]}; and (v) the last TI with two square roots: Path-count index: P) Σ i {p i 1/2 / [i 1/2 (µ + 1)]}. These five TIs are compared for their degeneracy, ordering of alkanes, and performance in QSPR (for all alkanes with 3-12 carbon atoms and for all possible chemical cyclic or acyclic graphs with 4-6 carbon atoms) in correlations with six physical properties and one chemical property. † Dedicated to Professor Nenad Trinajstić on the occasion of his 70th birthday.
Sign up for access to the world's latest research.
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.