by Gary Chartrand, Grzegorz Kubicki, Michelle Schultz
Abstract:
For connected graphs G 1 and G 2 of order n and a one-to-one mapping ϕ:V(G1)→V(G2) , the ϕ -distance between G 1 and G 2 is ¶¶ dϕ(G1,G2)=∑∣∣dG1(u,v)−dG2(ϕu,ϕv)∣∣,¶¶ where the sum is taken over all (n2) unordered pairs u,v of vertices of G 1. The distance between G 1 and G 2 is defined by d(G1,G2)=min\dϕ(G1,G2)\ , where the minimum is taken over all one-to-one mappings ϕ from V (G 1) to V (G 2). It is shown that this distance is a metric on the space of connected graphs of a fixed order. The maximum distance D(G1,G2)=max\dϕ(G1,G2)\ for connected graphs G 1 and G 2 of the same order is also explored. The total distance of a connected graph G is $\Sigma$d(u,v) , where the sum is taken over all unordered pairs u, v of vertices of G. Bounds for d (G 1, G 2) are presented both in terms of the total distances of G 1 and G 2 and also in terms of the sizes of G 1, G 2, and a greatest common subgraph of G 1 and G 2. For a set S of connected graphs having fixed order, the distance graph D(S) of S is that graph whose vertex set is S and such that two vertices G 1 and G 2 of D(S) are adjacent if and only if d (G 1, G 2) = 1. Furthermore, a graph G is a distance graph if there exists a set S of graphs having fixed order such that D(S)≅G . It is shown that every distance graph is bipartite and, moreover, that all even cycles and all forests are distance graphs. Other bipartite graphs are shown to be distance graphs and it is conjectured that all bipartite graphs are distance graphs.
Reference:
Graph similarity and distance in graphs (Gary Chartrand, Grzegorz Kubicki, Michelle Schultz), In Aequationes Mathematicae, Springer, volume 55, 1998.
Bibtex Entry:
@article{chartrand1998graph,
abstract = {For connected graphs G 1 and G 2 of order n and a one-to-one mapping ϕ:V(G1)→V(G2) , the ϕ -distance between G 1 and G 2 is ¶¶ dϕ(G1,G2)=∑∣∣dG1(u,v)−dG2(ϕu,ϕv)∣∣,¶¶ where the sum is taken over all (n2) unordered pairs u,v of vertices of G 1. The distance between G 1 and G 2 is defined by d(G1,G2)=min\{dϕ(G1,G2)\} , where the minimum is taken over all one-to-one mappings ϕ from V (G 1) to V (G 2). It is shown that this distance is a metric on the space of connected graphs of a fixed order. The maximum distance D(G1,G2)=max\{dϕ(G1,G2)\} for connected graphs G 1 and G 2 of the same order is also explored. The total distance of a connected graph G is $\Sigma$d(u,v) , where the sum is taken over all unordered pairs u, v of vertices of G. Bounds for d (G 1, G 2) are presented both in terms of the total distances of G 1 and G 2 and also in terms of the sizes of G 1, G 2, and a greatest common subgraph of G 1 and G 2. For a set S of connected graphs having fixed order, the distance graph D(S) of S is that graph whose vertex set is S and such that two vertices G 1 and G 2 of D(S) are adjacent if and only if d (G 1, G 2) = 1. Furthermore, a graph G is a distance graph if there exists a set S of graphs having fixed order such that D(S)≅G . It is shown that every distance graph is bipartite and, moreover, that all even cycles and all forests are distance graphs. Other bipartite graphs are shown to be distance graphs and it is conjectured that all bipartite graphs are distance graphs.},
author = {Chartrand, Gary and Kubicki, Grzegorz and Schultz, Michelle},
journal = {Aequationes Mathematicae},
keywords = {SML-LIB-BIBLIO,lang:ENG},
mendeley-tags = {SML-LIB-BIBLIO,lang:ENG},
number = {1-2},
pages = {129--145},
publisher = {Springer},
title = {{Graph similarity and distance in graphs}},
volume = {55},
year = {1998}
}