On the number of walks in trees

Match

Volumn , Issue 48, 2003, Pages 63-85

  Dress, Andreas ^a   Grünewald, Stefan ^a   Gutman, Ivan ^b   Lepović, Mirko ^b   Vidović, Dušica ^b  

^a BIELEFELD UNIVERSITY   (Germany)

^b UNIVERSITY OF KRAGUJEVAC   (Serbia)

Author keywords

[No Author keywords available]

Indexed keywords

ARTICLE; CHEMISTRY; MATHEMATICAL COMPUTING; MOLECULAR DYNAMICS; SPECTRUM; THEORETICAL STUDY;

EID: 0142139133     PISSN: 03406253     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (28)

1. I. Gutman and N. Trinajstić, Graph theory and molecular orbitals. The loop rule, Chem. Phys. Lett. 17 (1972) 535-538.
2. G. G. Hall, The evaluation of moments for polycyclic hydrocarbons, Theor. Chim. Acta 70 (1986) 323-332.
3. Y. Jiang, A. Tang and R. Hoffmann, Evaluation of moments and their application to Hückel molecular orbital theory, Theor. Chim. Acta 65 (1984) 255-265.
4. S. Marković and I. Gutman, Dependence of spectral moments of benzenoid hydrocarbons on molecular structure, J. Mol. Struct. (Theochem) 235 (1991) 81-87.
5. E. Estrada, Spectral moments of the edge adjacency matrix in molecular graphs. 1. Definition and applications to the prediction of physical properties of alkanes, J. Chem. Inf. Comput. Sci. 36 (1996) 844-849.
6. E. Estrada, Spectral moments of the edge adjacency matrix in molecular graphs. 3. Molecules containing cycles, J. Chem. Inf. Comput. Sci. 38 (1998) 23-27.
7. I. Gutman, S. Marković, A. Vesović and E. Estrada, Approximating total π-electron energy in terms of spectral moments. A quantitative approach, J. Serb. Chem. Soc. 63 (1998) 639-646.
8. S. Marković, Z. Marković, R. I. McCrindle, Spectral moments of phenylenes, J. Chem. Inf. Comput. Sci. 41 (2001) 112-119.
9. M. Randić, Random walks and their diagnostic value for characterization of atomic environment, J. Comput. Chem. 1 (1980) 386-399.
10. M. Randić, W. L. Woodworth and A. Graovac, Unusual random walks, Int. J. Quantum Chem. 24 (1983) 435-452.
11. G. Rücker and C. Rücker, Isocodal and isospectral points, edges, and pairs in graphs and how to cope with them in computerized symmetry recognition, J. Chem. Inf. Comput. Sci. 31 (1991) 422-427.
12. C. Rücker and G. Rücker, Understanding the properties of isospectral points and pairs in graphs: The concept of orthogonal relation, J. Math. Chem. 9 (1992) 207-238.
13. O. Ivanciuc and A. T. Balaban, Characterization of chemical structures by the atomic counts of self-returning walks: On the construction of isocodal graphs, Croat. Chem. Acta 69 (1996) 63-74.
14. M. Razinger, Discrimination and ordering of chemical structures by the number of walks, Theor. Chim. Acta 70 (1986) 365-378.
15. A. S. Shalabi, Random walks: Computations and applications to chemistry, J. Chem. Inf. Comput. Sci. 31 (1991) 483-491.
16. G. Rücker and C. Rücker, Counts of all walks as atomic and molecular descriptors, J. Chem. Inf. Comput. Sci. 33 (1993) 683-695.
17. C. Rücker and G. Rücker, Mathematical relation between extended connectivity and eigenvector coefficients, J. Chem. Inf. Comput. Sci. 34 (1994) 534-538.
18. G. Rücker and C. Rücker, On topological indices, boiling points, and cycloalkanes, J. Chem. Inf. Comput. Sci. 39 (1999) 788-802.
19. G. Rücker and C. Rücker, Walk counts, labyrinthicity, and complexity of acyclic and cyclic graphs and molecules, J. Chem. Inf. Comput. Sci. 40 (2000) 99-106.
20. I. Gutman, C. Rücker and G. Rücker, On walks in molecular graphs, J. Chem. Inf. Comput. Sci. 41 (2001) 739-745.
21. G. Rücker and C. Rücker, Substructure, subgraph and walk counts as measures of the complexity of graphs and molecules, J. Chem. Inf. Comput. Sci. 41 (2001) 1457-1462.
22. D. M. Cvetković, M. Doob and H. Sachs, Spectra of Graphs - Theory and Application, Academic Press, New York, 1980.
23. D. M. Cvetković, P. Rowlinson and S. Simić, Eigenspaces of Graphs, Cambridge Univ. Press, Cambridge, 1997.
24. D. M. Cvetković and I. Gutman, Note on branching, Croat. Chem. Acta 49 (1977) 115-121.
25. A. Dress and I. Gutman, On the number of walks in a graph, Appl. Math. Lett., to appear.
26. A. Dress and I. Gutman, Asymptotic results regarding the number of walks in a graph, Appl. Math. Lett., to appear.
27. S. Grünewald, Harmonic trees, Appl. Math. Lett., to appear.
28. B. Borovićanin, S. Grünewald, I. Gutman and M. Petrović, Harmonic graphs with small number of cycles, Discrete Math., to appear.