Distances between graphs under edge operations

Discrete Mathematics

Volumn 161, Issue 1-3, 1996, Pages 121-132

  Goddard, Wayne ^a   Swart, Henda C ^a  

^a UNIVERSITY OF KWAZULU NATAL   (South Africa)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001113462     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(95)00073-6     Document Type: Article

References (9)

1. V. Baláz, J. Koča, V. Kvasnička, and M. Sekanina, A measure for graphs, Časopis Pěst. Mat. 111 (1986) 431-433.
2. G. Benadé, W. Goddard, T.A. McKee and P.A. Winter, On distances between isomorphism classes of graphs, Math. Bohemica 116 (1991) 160-169.
3. G. Chartrand, F. Saba and H. Zou, Edge rotations and distance between graphs, Časopis Pěst. Mat. 110 (1985) 87-91.
4. M. Johnson, Relating metrics, lines and variables defined on graphs to problems in medicinal chemistry, in: (Y. Alavi et al. eds), Graph Theory with Applications to Algorithms & Computer Science (Wiley, New York, 1985) 457-470.
5. M. Johnson, An ordering of some metrics defined on the space of graphs, Czech. Math. J. 37 (1987) 75-85.
6. B. Zelinka, On a certain distance between isomorphism classes of graphs, Časopis Pěst. Mat. 100 (1975) 371-373.
7. B. Zelinka, A distance between isomorphism classes of trees, Czech. Math. J. 33 (1983) 126-130.
8. B. Zelinka, Comparison of various distances between isomorphism classes of graphs, Časopis Pěst. Mat. 110 (1985) 289-293.
9. B. Zelinka, Contraction distance between isomorphism classes of graphs, Časopis Pěst. Mat. 115 (1990) 211-216.