Walking backward: Walk counts of negative order

Journal of Chemical Information and Computer Sciences

Volumn 43, Issue 4, 2003, Pages 1115-1120

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

^a UNIVERSITY OF FREIBURG   (Germany)

^b UNIVERSITY OF BAYREUTH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; EIGENVALUES AND EIGENFUNCTIONS; MATRIX ALGEBRA; VECTORS;

WALK COUNTS;

MOLECULAR GRAPHICS;

EID: 18344400043     PISSN: 00952338     EISSN: None     Source Type: Journal    
DOI: 10.1021/ci0304019     Document Type: Article

References (17)

1. Rücker, G.; Rücker, C. Counts of All Walks as Atomic and Molecular Descriptors. J. Chem. Inf. Comput. Sci. 1993, 33, 683-695.
2. Rücker, G.; Rücker, C. On Topological Indices, Boiling Points, and Cycloalkanes. J. Chem. Inf. Comput. Sci. 1999, 39, 788-802.
3. Rücker, G.; Rücker, C. Walk Counts, Labyrinthicity, and Complexity of Acyclic and Cyclic Graphs and Molecules. J. Chem. Inf. Comput. Sci. 2000, 40, 99-106.
4. Rücker, G.; Rücker C. Substructure, Subgraph, and Walk Counts as Measures of the Complexity of Graphs and Molecules. J. Chem. Inf. Comput. Sci. 2001, 41, 1457-1462.
5. Nikolić, S.; Trinajstić, N.; Tolić, I. M.; Rücker, G.; Rücker, C. On Molecular Complexity Indices, In Complexity in Chemistry; Rouvray, D. H., Bonchev, D., Eds.; Francis & Taylor: London, 2003.
6. Harary, F. Graph Theory; Addison-Wesley: Reading, MA, 1969.
7. Trinajstić, N. Chemical Graph Theory, 2nd ed.; CRC Press: Boca Raton, FL, 1992.
8. Lukovits, I.; Trinajstić, N. Atomic Walk Counts of Negative Order. J. Chem. Inf. Comput. Sci. 2003, 43, 1110-1114.
9. Harary, F.; Schwenk, A. J. The Spectral Approach to Determining the Number of Walks in a Graph. Pac. J. Math. 1979, 80, 443-449.
10. Rücker, C.; Rücker, G. Mathematical Relation between Extended Connectivity and Eigenvector Coefficients. J. Chem. Inf. Comput. Sci. 1994, 34, 534-538.
11. Gutman, L; Rücker, C.; Rücker, G. On Walks in Molecular Graphs. J. Chem. Inf. Compta. Sci. 2001, 41, 739-745.
12. Rücker, G.; Rücker, C.; Gutman, I. On Kites, Comets, and Stars. Sums of Eigenvector Coefficients in (Molecular) Graphs. Z Naturforsch. A 2002, 57a, 143-153.
13. 2 over the indices i belonging to the same eigenspace is uniquely determined, see ref 10.
14. 1).
15. This is also true in the case of degenerate eigenvalues, as can be shown.
16. 0 is the smallest absolute value of a nonnull element of M.
17. Lukovits, I.; Milicević, A.; Nikolić, S.; Trinajstić, N. On Walk Counts and Complexity of General Graphs. Internet Electron. J. Mol. Des. 2002, 1, 388-400, http://www.biochempress.com.