Displaying similar documents to “Distances between directed graphs”

On distances between isomorphism classes of graphs

Gerhard Benadé, Wayne Goddard, Terry A. McKee, Paul A. Winter (1991)

Mathematica Bohemica

Similarity:

In 1986, Chartrand, Saba and Zou [3] defined a measure of the distance between (the isomorphism classes of) two graphs based on 'edge rotations'. Here, that measure and two related measures are explored. Various bounds, exact values for classes of graphs and relationships are proved, and the three measures are shown to be intimately linked to 'slowly-changing' parameters.

Equivalences between isomorphism classes on infinite graphs

Bohdan Zelinka (1992)

Mathematica Bohemica

Similarity:

The paper studies some equivalence relations between isomorphism classes of countable graphs which correspond in a certain sense to various distances between isomorphism classes of finite graphs.