SYLLABUS

UNIT III GRAPHS

Graphs and graph models – Graph terminology and special

types of graphs – Matrix representation of graphs and graph
isomorphism – Connectivity – Euler and Hamilton paths.
Degree of Vertex in Directed Graph:
Or
Complete Bipartite Graph
Adjacency Matrix
 Graph Isomorphism
Definition:
Two graphs G1 and G2 are said to be Isomorphic to each other if
there exists ono to one, onto correspondence between the vertex sets
which preserves adjacency of the vertices and non-adjacency of the
vertices.
Determine whether the graphs below are Isomorphic or not
U1
V1
U5 U2 V5 V2

U3 V4 V3
U4

Solution: G1 G2
V(G1)={U1,U2,U3,U4,U5}=5 V(G2)={V1,V2,V3,V4,V5}=5
Deg(U1) = 2 Deg(V1) = 2
Deg(U2) = 2 Deg(V2) = 2
Deg(U3) = 2 Deg(V3) = 2
Deg(U4) = 2 Deg(V4) = 2
Deg(U5) = 2 Deg(V5) = 2
 U1 V1
V1
V5 V2
U5 U2
V4 V3
V4 V3
U4 U3
V2 V5
Determine whether the graphs below are Isomorphic or not

Solution: G1 G2
V(G1)={U1,U2,U3,U4,U5}=5 V(G2)={V1,V2,V3,V4,V5}=5
Deg(U1) = 3 Deg(V1) = 3
Deg(U2) = 4 Deg(V2) = 2
Deg(U3) = 2 Deg(V3) = 4
Deg(U4) = 4 Deg(V4) = 3
Deg(U5) = 3 Deg(V5) = 4
Determine whether the graphs below are Isomorphic or not

Solution:
Solution:
 G1 G2
V(G1)={U1,U2,U3,U4, U5,U6}=6 V(G2)={V1,V2,V3,V4, V5,V6}=6
Deg(U1) = 2 Deg(V1) = 2
Deg(U2) = 3 Deg(V2) = 3
Deg(U3) = 3 Deg(V3) = 3
Deg(U4) = 2 Deg(V4) = 2
Deg(U5) = 3 Deg(V5) = 3
Deg(U6) = 3 Deg(V6) = 3
 Path

Length of the Path

The number of edges appearing in the sequences of a path is
called length of a Path.
Cycle or Circuit
Connected & Disconnected Graph
Strongly Connected Graph
Theorem

Proof:

Now
Eulerian Path
Eulerian Circuit

Eulerian Graph
A graph containing an Eulerian Circuit is called an Eulerian Graph.
Hamiltonian Path
Hamiltonian Circuit

Hamiltonian Graph