Graph Isomorphism
Definition
Let G = (V , E ), G = (V , E ) tw
a one-to-one function.
1 f preserve adjacency if for
2 f preserve non-adjacency if
u, v then f (u), f (v ) are non-a
3 f is a graph isomorphism f
preserve both adjacency and
write G ∼= G .
ab c
G G’
Arash Rafiey
wo graphs. Suppose f : V → V is
every uv ∈ E , f (u)f (v ) ∈ E .
f for every non adjacent vertices
adjacent.
from G to G if it is bijective and
non-adjacency. In this case we
d
f(a)=c and f(b)=d
f is isomorphism
An introduction to graph theory
ab
ef
hg c
d
G
Arash Rafiey
uv
yz
ts
xw
H
An introduction to graph theory
ab
ef
hg c
d
G
e f
a b
h g
d c
Arash Rafiey
uv
yz
ts
xw
H
uv
wx
yz
st
An introduction to graph theory
The words you are searching are inside this book. To get more targeted content, please make full-text search by clicking here.
An introduction to graph theory Arash Rafiey 13 October, 2015 Arash Rafiey An introduction to graph theory
Discover the best professional documents and content resources in AnyFlip Document Base.
Search