On the Zagreb Indices as Complexity Indices

Croatica Chemica Acta

Volumn 73, Issue 4, 2000, Pages 909-921

  Nikolić, Sonja ^a   Tolić, Iva Marija ^a   Trinajstić, Nenad ^a   Baučić, Ivo ^b  

^a RUDER BO KOVI INSTITUTE   (Croatia)

^b UNIVERSITY OF ZAGREB   (Croatia)

Author keywords

Complexity indices; Molecular graphs; Saturated hydrocarbons; Zagreb indices

Indexed keywords

EID: 0001486089     PISSN: 00111643     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (35)

1. A. T. Balaban, Chem. Phys. Lett. 89 (1982) 399-404.
2. S. C. Basak, B. D. Gute, and G. D. Grunwald, Croat. Chem. Acta 69 (1996) 1159-1173.
3. S. C. Basak, G. D. Grunwald, and G. J. Niemi, in: A. T. Balaban (Ed.), From Chemical Topology to Three-Dimensional Geometry, Plenum Press, New York, 1997, pp. 73-116.
4. S. H. Bertz and W. F. Wright, Graph Theory Notes of New York 35 (1998) 32-48.
5. I. Gutman and N. Trinajstić, Chem. Phys. Lett. 17 (1972) 535-538.
6. I. Gutman, B. Ruščić, N. Trinajstić, and C. F. Wilcox, Jr., J. Chem. Phys. 62 (1975) 3399-3405.
7. S. C. Basak and G. D. Grunwald, SAR QSAR Environ. Res. 5 (1995) 265-277.
8. B. D. Gute and S. C. Basak, SAR QSAR Environ. Res. 7 (1997) 117-131.
9. S. C. Basak, B. D. Gute, and S. Ghatak, J. Chem. Inf. Comput. Sci. 39 (1999) 255-260.
10. F. Harary, Graph Theory, second printing, Addison-Wesley, Reading, MA, 1972.
11. N. Trinajstić, Chemical Graph Theory, 2nd revised edition, CRC Press, Boca Raton, FL, 1992.
12. S. C. Basak, S. Nikolić, N. Trinajstić, D. Amić, and D. Bešlo, J. Chem. Inf. Comput. Sci. 40 (2000) 927-933.
13. D. Bonchev, J. Mol. Struct. (THEOCHEM) 336 (1995) 137-156.
14. A walk on a graph is an alternating sequence of vertices and edges beginning and ending with vertices, in which each edge is incident with two vertices immediately preceding and following it. A self-returning walk is a walk starting and ending at the same vertex.
15. Branching is an intuitive concept not uniquely defined (e.g., J. W. Essam and M. E. Fisher, Rev. Mod. Phys. 42 (1970) 272-305), though it can be identified through the appearance of vertices of degrees three and higher.
16. One can look upon cyclicity as a kind of structural change resembling branching in that the values of degrees of some vertices within the cycle increase from two to three and higher at the sites of bridging cycle. This structural characteristic has been named (D. Bonchev, Bulg. Chem. Comm. 28 (1995) 567-582) an internal branching. Therefore, the degree of a vertex in a cycle can increase either by cyclization (the internal branching) or by attaching to it acyclic, cyclic or spiro-cyclic fragments (the external branching). These three possibilities correspond, for example, to cyclohexane → bicyclo[2.2.0]hexane, cyclohexane → isopropylcyclohexane and cyclohexane → spiro[3.5]nonane.
17. K. Mainzer, Hyle 3 (1997) 29-49.
18. M. Randić, On the Concept of Molecular Complexity, Croat. Chem. Acta, in press.
19. G. Rücker and C. Rücker, J. Chem. Inf. Comput. Sci. 40 (2000) 99-106.
20. S. Nikolić, I. M. Tolić, and N. Trinajstić, J. Chem. Inf. Comput. Sci.40 (2000) 920-926.
21. S. H. Bertz, J. Am. Chem. Soc. 103 (1981) 3599-3601.
22. S. H. Bertz, in: R. B. King (Ed.), Chemical Applications of Topology and Graph Theory, Elsevier, Amsterdam, 1983, pp. 206-221.
23. D. Bonchev, SAR QSAR Environ. Res. 7 (1997) 23-43.
24. S. H. Bertz and T. J. Sommer, Chem. Commun. 1997, 2409-2410.
25. D. Bonchev and N. Trinajstić, J. Chem. Phys. 67 (1977) 4517-4533.
26. D. Bonchev, in: D. H. Rouvray (Ed.), Computational Chemical Graph Theory, Nova Sci. Publ., Commack, N.Y., 1990, pp. 33-63.
27. T.
28. T.
29. The rules used are: (i) branched trees are more complex than unbranched trees; (ii) trees with several branches are more complex than trees with a single branch; (iii) cyclic structures are more complex than the corresponding acyclic structures; (iv) bicyclic structures are more complex than monocyclic structures; (v) branched cycles are more complex than cycles without branches and (vi) cycles with several external branches are more complex than cycles with a single branch.
30. S. H. Bertz, Discrete Appl. Math. 19 (1988) 65-83.
31. O. Mekenyan, D. Bonchev, and N. Trinajstić, Croat. Chem. Acta 56 (1983) 237-261.
32. D. Bonchev and O. E. Polansky, in: R. B. King and D. H. Rouvray (Eds.), Graph Theory and Topology in Chemistry, Elsevier, Amsterdam, 1987, pp. 126-158.
33. D. Bonchev, in: J. Devillers and A. T. Balaban (Eds.), Topological Indices and Related Descriptors in QSAR and QSPR, Gordon & Breach, Amsterdam, 1999., pp. 361-401.
34. D. Bonchev and E. Gordeeva, Hierarchically Ordered Sets (HOSETS) Based on Topological Complexity, preprint.
35. D. Minoli, Atti Acad. Naz. Lincei Rend. Cl. Sci. Fis. Mat. Natur. (Ser. 8) 59 (1976) 651-661.