DM 17 Connectivity
DM 17 Connectivity
Connectivity 8.4
• Paths
• Circuits
• Simple path and Simple circuits
• Connectedness in undirected Graph
• Connectedness in directed Graph
• Graph Isomorphism : checking simple circuit of certain
length
Objectives and Outcomes
• Objectives: To understand the terms path, circuit, simple path,
simple circuit; to understand connectedness in undirected and
directed graphs, to determine whether two graphs are isomorphic.
1 2
3
4
Connectivity
1 2
3
4
Connected Components
7
8
5 3
4
Connected Components
1
6 2
8 7
5 3
4
Connectedness in Directed
Graphs
Weakly Strongly
H is strongly connected because
Connected Connected there is a path between any two
vertices in this directed graph.
Hence, H is also weakly connected.
G H
Example
a b a b
c
c
e d e d
Graph G Graph H
Paths and Isomorphism
• There are several ways that paths & circuits can help
determine whether two graphs are isomorphic.
– For example, the existence of a simple circuit of a
particular length is a useful invariant that can be used to
show that two graphs are not isomorphic
• A useful isomorphic invariant for simple graphs is
the existence of a simple circuit of length k, where k
is a positive integer greater than 2.
Graph Isomorphism – Example
Determine whether the graphs G and H are isomorphic.
v2 u2
v1 v3 u1 u3
v5 v4 u5 u4
G H
Solution
Figure 8
Solution
Figure 9
Solution
For example, the paths u1, u4,u3, u2, u5 in G and v3, v2, v1, v5, v4 in H both go
through every vertex in the graph; start at a vertex of degree three; go
through vertices of degrees two, three, and two, respectively; and end at a
vertex of degree two.
By following these paths through the graphs, we can define the mapping f
with
f (u1) = v3
f (u2) = v5
f (u3) = v1
f (u4) = v2
f (u5) = v4
It shows that f is an isomorphism, so G and H are isomorphic.
Books