Discrimination of isomeric structures using information theoretic topological indices

C. Raychaudhury; S. K. Ray; J. J. Ghosh; A. B. Roy; S. C. Basak

doi:10.1002/jcc.540050612

Discrimination of isomeric structures using information theoretic topological indices

C. Raychaudhury, S. K. Ray, J. J. Ghosh, A. B. Roy, S. C. Basak

Natural Resources Research Institute

Research output: Contribution to journal › Article › peer-review

128 Scopus citations

Abstract

Three newly defined information theoretic topological indices, namely “degree complexity (I^d),” “graph vertex complexity (H^V),” and “graph distance complexity (H^D)” 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 H^D has been found to be the only index to discriminate all the graphs studied.

Original language	English (US)
Pages (from-to)	581-588
Number of pages	8
Journal	Journal of Computational Chemistry
Volume	5
Issue number	6
DOIs	https://doi.org/10.1002/jcc.540050612
State	Published - Dec 1984

Access

10.1002/jcc.540050612

OpenUrl availability

Full text

Cite this

@article{c39dd8e27c9e4070b4f67557f2a8bf8c,

title = "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.",

author = "C. Raychaudhury and Ray, {S. K.} and Ghosh, {J. J.} and Roy, {A. B.} and Basak, {S. C.}",

year = "1984",

month = dec,

doi = "10.1002/jcc.540050612",

language = "English (US)",

volume = "5",

pages = "581--588",

journal = "Journal of Computational Chemistry",

issn = "0192-8651",

publisher = "John Wiley and Sons Inc.",

number = "6",

}

TY - JOUR

T1 - Discrimination of isomeric structures using information theoretic topological indices

AU - Raychaudhury, C.

AU - Ray, S. K.

AU - Ghosh, J. J.

AU - Roy, A. B.

AU - Basak, S. C.

PY - 1984/12

Y1 - 1984/12

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84988058305&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84988058305&partnerID=8YFLogxK

U2 - 10.1002/jcc.540050612

DO - 10.1002/jcc.540050612

M3 - Article

AN - SCOPUS:84988058305

SN - 0192-8651

VL - 5

SP - 581

EP - 588

JO - Journal of Computational Chemistry

JF - Journal of Computational Chemistry

IS - 6

ER -

Discrimination of isomeric structures using information theoretic topological indices

Abstract

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this