1984
DOI: 10.1002/jcc.540050612
|View full text |Cite
|
Sign up to set email alerts
|

Discrimination of isomeric structures using information theoretic topological indices

Abstract: Three newly defined information theoretic topological indices, namely “degree complexity (Id),” “graph vertex complexity (HV),” and “graph distance complexity (HD)” along with three other information indices have been used to study their discriminating power of 45 trees and 19 monocyclic graphs. It is found that the newly defined indices have satisfactory discriminating power while HD has been found to be the only index to discriminate all the graphs studied.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
73
0
1

Year Published

1990
1990
2016
2016

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 124 publications
(74 citation statements)
references
References 13 publications
0
73
0
1
Order By: Relevance
“…H , ICO, and SICo = topological parameters: Raychaudhury et al [42]; information and struc-'n(6) atomic charge on atom N(6) [35]. tions between topological indices used here and physicochemical properties of molecules (see Table IX for more details).…”
Section: (B) Discussionmentioning
confidence: 99%
“…H , ICO, and SICo = topological parameters: Raychaudhury et al [42]; information and struc-'n(6) atomic charge on atom N(6) [35]. tions between topological indices used here and physicochemical properties of molecules (see Table IX for more details).…”
Section: (B) Discussionmentioning
confidence: 99%
“…This value may give the valency of the atom it is representing if hydrogen-filled graphs are considered. Again, the sum of all the entries of any row / column of D(G), known as distance sum, 9,10,16,17 is obtained from the distance distribution of all the vertices of G from the given vertex. From structural point of view, this distance distribution helps get some interesting features.…”
Section: Methodsmentioning
confidence: 99%
“…Let there be n i vertices at a distance d i from a vertex v in a molecular graph for which the vertex index D x has to be computed and d i , i = 1, 2, …, m, are different topological distances 10,13,16,17 of those n vertices from v (vertex v lies at a distance zero from itself) in that molecular graph. Then the index D x for vertex v may be computed from Equation (1).…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…HVcpx represents the graph vertex complexity index [15], BIC2 symbolizes the Bond Information Content (neighborhood symmetry of second order) [16], GATS7e denotes Geary autocorrelation -lag 7, weighted by atomic Sanderson electronegativities, and GATS8p stands for Geary autocorrelation -lag 8, weighted by atomic polarizabilities [17]. This df has been already applied in VS, discovering the anticonvulsant activities of abietic acid, and methyl and propyl paraben [18 -20].…”
Section: Full Papersmentioning
confidence: 99%