Semiharmonic trees and monocyclic graphs

Applied Mathematics Letters

Volumn 16, Issue 8, 2003, Pages 1329-1332

  Dress, A ^a   Grunewald S ^a  

^a BIELEFELD UNIVERSITY   (Germany)

Author keywords

Cyclomatic number; Harmonic graphs; Monocyclic graph; Trees; Walks in graphs

Indexed keywords

GRAPH THEORY; HARMONIC ANALYSIS; PROBLEM SOLVING; THEOREM PROVING;

MONOCYCLIC GRAPHS; SEMIHARMONIC TREES;

TREES (MATHEMATICS);

EID: 0242442618     PISSN: 08939659     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0893-9659(03)90137-6     Document Type: Article

References (11)

1. I. Gutman, C. Rücker and G. Rücker, On walks in molecular graphs, J. Chem. Inf. Comput. Sci. 41, 739-745, (2001).
2. M. Razinger, Discrimination and ordering of chemical structures by the number of walks, Theor. Chim. Acta 70, 365-378 (1986).
3. A.S. Shalabi, Random walks: Computations and applications to chemistry, J. Chem. Inf. Comput. Sci. 31, 483-491 (1991).
4. G. Rücker and C. Rücker, Counts of all walks as atomic and molecular descriptors, J. Chem. Inf. Comput. Sci. 33, 683-695 (1993).
5. C. Rücker and G. Rücker, Mathematical relation between extended connectivity and eigenvector coefficients, J. Chem. Inf. Comput. Sci. 34, 534-538, (1994).
6. G. Rücker and C. Rücker, On topological indices, boiling points, and cycloalkanes, J. Chem. Inf. Comput. Sci. 39, 788-802, (1999).
7. 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, 99-106, (2000).
8. A. Dress and I. Gutman, The number of walks in graphs, Appl. Math. Lett. 16 (5), 797-801, (2003).
9. S. Grünewald, Harmonic trees, Appl. Math. Lett. 15 (8), 1001-1004, (2002).
10. B. Borovićanin, S. Grünewald, I. Gutman and M. Petrović, Harmonic graphs with small number of cycles.
11. D. Cvetković, M. Doob and H. Sachs, Spectra of Graphs, Theory and Application, Academic Press, New York, (1980).