Walk Counts, Labyrinthicity, and Complexity of Acyclic and Cyclic Graphs and Molecules

Journal of Chemical Information and Computer Sciences

Volumn 40, Issue 1, 2000, Pages 99-106

  Rücker, Gerta ^a   Rücker, Christoph ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002525670     PISSN: 00952338     EISSN: None     Source Type: Journal    
DOI: 10.1021/ci9900579     Document Type: Article

References (47)

1. (a) Bertz, S. H. The First General Index of Molecular Complexity. J. Am. Chem. Soc. 1981, 103, 3599-3601.
2. (b) Bertz, S. H. A Mathematical Model of Molecular Complexity. In Chemical Applications of Topology and Graph Theory; King, R. B., Ed.; Elsevier: Amsterdam, 1983; pp 206-221.
3. (c) Bertz, S. H.; Sommer, T. J. Applications of Graph Theory to Synthesis Planning: Complexity, Reflexivity, and Vulnerability. In Organic Synthesis: Theory and Application; Hudlicky, T., Ed.; JAI Press: Greenwich, CT, 1993; Vol. 2, pp 67-92.
4. Bertz, S. H.; Sommer, T. J. Rigorous Mathematical Approaches to Strategic Bonds and Synthetic Analysis Based on Conceptually Simple New Complexity Indices. Chem. Commun. 1997, 2409-2410.
5. (a) Whitlock, H. W. On the Structure of Total Synthesis of Complex Natural Products. J. Org. Chem. 1998, 63, 7982-7989.
6. (b) Chanon, M.; Barone, R.; Baralotto, C.; Juillard, M.; Hendrickson, J. B. Information Theory Description of Synthetic Strategies in the Polyquinane Series. The Holosynthon Concept. Synthesis 1998, 1559-1583.
7. (a) Bonchev, D.; Polansky, O. E. On the Topological Complexity of Chemical Systems. In Graph Theory and Topology in Chemistry; King, R. B., Rouvray, D. H., Eds.; Elsevier: Amsterdam, 1987; pp 126-158.
8. (b) Bonchev, D. The Problems of Computing Molecular Complexity. In Computational Chemical Graph Theory; Rouvray, D. H., Ed.; Nova Science Publishers: New York, 1990; pp 34-63.
9. (c) Bonchev, D.; Seitz, W. A. The Concept of Complexity in Chemistry. In Concepts in Chemistry - a Contemporary Challenge; Rouvray, D. H., Ed.; Research Studies Press: Taunton, 1997; pp 353-381.
10. (d) Bonchev, D. Novel Indices for the Topological Complexity of Molecules. SAR QSAR Environm. Res. 1997, 7, 23-43.
11. (e) Bonchev, D. Overall Connectivity and Topological Complexity: A New Tool for QSPR/QSAR. In Topological Indices and Related Descriptors in QSAR and QSPR; Devillers, J., Balaban, A. T., Eds.; Gordon & Breach: Langhorne, PA, 1999; pp 361-401.
12. (a) Randić, M. On Molecular Branching. Acta Chim. Slov. 1997, 44, 57-77.
13. (b) Randić, M. On the Concept of Molecular Complexity. Croat. Chem. Acta., in press.
14. Randić, M. On Characterization of Molecular Branching. J. Am. Chem. Soc. 1975, 97, 6609-6615.
15. (a) Bonchev, D. Trinajstić, N. Information Theory, Distance Matrix, and Molecular Branching. J. Chem. Phys. 1977, 67, 4517-4533.
16. (b) Bonchev, D. Topological Order in Molecules. 1. Molecular Branching Revisited. J. Mol. Struct.: THEOCHEM 1995, 336, 137-156.
17. (a) Bonchev, D.; Mekenyan, O.; Trinajstić, N. Topological Characterization of Cyclic Structures. Int. J. Quantum Chem. 1980, 17, 845-893.
18. (b) Mekenyan, O.; Bonchev, D.; Trinajstić, N. Algebraic Characterization of Bridged Polycyclic Compounds. Int. J. Quantum Chem. 1981, 19, 929-955.
19. (c) Mekenyan, O.; Bonchev, D.; Trinajstić, N. Structural Complexity and Molecular Properties of Cyclic Molecules with Acyclic Branches. Croat. Chem. Acta 1983, 56, 237-261.
20. (d) Bonchev, D.; Balaban, A. T.; Liu, X.; Klein, D. J. Molecular Cyclicity and Centricity of Polycyclic Graphs. I. Cyclicity Based on Resistance Distances or Reciprocal Distances. Int. J. Quantum Chem. 1994, 50, 1-20.
21. Bertz, S. H. Branching in Graphs and Molecules. Discr. Appl. Math. 1988, 19, 65-83.
22. Randić, M. On Characterization of Cyclic Structures. J. Chem. Inf. Comput. Sci. 1997, 37, 1063-1071.
23. Cvetković, D. M.; Gutman, I. Note on Branching. Croat. Chem. Acta 1977, 49, 115-121. See also: Lovasz, L.; Pelikan, J. On the Eigenvalues of Trees. Period. Math. Hung. 1973, 3, 175-182.
24. Cvetković, D. M.; Gutman, I. Note on Branching. Croat. Chem. Acta 1977, 49, 115-121. See also: Lovasz, L.; Pelikan, J. On the Eigenvalues of Trees. Period. Math. Hung. 1973, 3, 175-182.
25. Randić, M.; Brissey, G. M.; Spencer, R. B.; Wilkins, C. L. Search for All Self-Avoiding Paths for Molecular Graphs. Comput. Chem. 1979, 3, 5-13.
26. Gutman, I.; Mallion, R. B.; Essam, J. W. Counting the Spanning Trees of a Labelled Molecular Graph. Mol. Phys. 1983, 50, 859-877.
27. Nikolić, S.; Trinajstić, N.; Jurić, A.; Mihalić, Z.; Krilov, G. Complexity of Some Interesting (Chemical) Graphs. Croat. Chem. Acta 1996, 69, 883-897.
28. Rücker, C. Habilitation Thesis (in German), Universität Freiburg, 1991. A few κ values are as follows: cyclohexane 0.167, cyclopentane 0.200, cyclobutane 0.250, cyclopropane 0.333, bicyclo[1.1.1]pentane 0.400, bicyclo[1.1.0]butane 0.500, perhydrofullerene[60] 0.517, dodecahedrane 0.550, quadricyclane 0.571, hexaprismane 0.583, [1.1.1]propellane 0.600, cubane, cuneane, and octabisvalene 0.625 each, prismane 0.667, tetrahedrane 0.750.
29. (a) Rücker, G.; Rücker, C. Computer Perception of Constitutional (Topological) Symmetry: TOPSYM, a Fast Algorithm for Partitioning Atoms and Pairwise Relations among Atoms into Equivalence Classes. J. Chem. Inf. Comput. Sci. 1990, 30, 187-191.
30. (b) Rücker, G.; Rücker, C. On Using the Adjacency Matrix Power Method for Perception of Symmetry and for Isomorphism Testing of Highly Intricate Graphs. J. Chem. Inf. Comput. Sci. 1991, 31, 123-126.
31. (c) Rücker, G.; Rücker, C. Isocodal and Isospectral Points, Edges, and Pairs in Graphs and How to Cope with Them in Computerized Symmetry Recognition. J. Chem. Inf. Comput. Sci. 1991, 31, 422-427.
32. Rücker, G.; Rücker, C. Counts of All Walks as Atomic and Molecular Descriptors. J. Chem. inf. Comput. Sci. 1993, 33, 683-695.
33. Rücker, G.; Rücker, C. On Topological Indices, Boiling Points, and Cycloalkanes. J. Chem. Inf. Comput. Sci. 1999, 39, 788-802.
34. Bertz, S. H.; Herndon, W. C. Similarity of Graphs and Molecules. In Artificial Intelligence Applications in Chemistry; Pierce, T. H., Hohne, B. A., Eds.; American Chemical Society: Washington, DC, 1986; pp 169-175.
35. Bone, R. G. A.; Villar, H. O. Exhaustive Enumeration of Molecular Substructures. J. Comput. Chem. 1997, 18, 86-107.
36. Randić, M. Augmented Valence - Novel Graph Theoretical Index with an Apparent Interpretation. Int. J. Quantum Chem., in press.
37. Bertz, S. H.; Zamfirescu, C. New Complexity Indices Based on Edge Covers. MATCH-Commun. Math. Comput. Chem., in press.
38. (a) Harary, F. Graph Theory; Addison-Wesley: Reading, MA, 1969; Chapter 13.
39. (b) Trinajstić, N. Chemical Graph Theory, 2nd ed.; CRC Press: Boca Raton, FL, 1992; p 48.
40. The Cayley-Hamilton theorem states that the higher powers of A, starting from A", are linear combinations of lower powers and as such do not contribute new information.
41. Figueras, J. Morgan Revisited. J. Chem. Inf. Comput. Sci. 1993, 33, 717-718.
42. Rücker, C.; Rücker, G. Mathematical Relation between Extended Connectivity and Eigenvector Coefficients. J. Chem. Inf. Comput. Sci. 1994, 34, 534-538.
43. Klin, M.; Rücker, C.; Rücker, G.; Tinhofer, G. Algebraic Combinatorics in Mathematical Chemistry. Methods and Algorithms. I. Permutation Groups and Coherent (Cellular) Algebras. Technical Report, Technical University of Munich, 1995.
44. Razinger, M. Discrimination and Ordering of Chemical Structures by the Number of Walks. Theor. Chim. Acta 1986, 70, 365-378.
45. We tested the degeneracy of twc in the sample of all possible mono-and bicyclic octanes in order to compare it with that of I(LW). Within this sample of N = 255 structures twc has 236 distinct values, while Razinger reported 245 distinct values of I(LW) in a corresponding (but incomplete) sample of N = 250.
46. The number of subgraphs and Bonchev's TC1 and TC similarly have a maximum somewhere along the same sequence.
47. Rücker, G.; Rücker, C. Automatic Enumeration of All Connected Subgraphs. MATCH-Commun. Math. Comput. Chem., in press.