DISCRETE

MATHEMATICS
-ROSEN DISCRETE
MATH
ARE THESE TWO GRAPHS
ISOMORPHIC?

Graph G Graph H
 COUNTING THE VERTICES,
EDGES AND FINDING THE
DEGREES
Graph G has 7 vertices and 9 edges
Listing the vertices and their degrees, we have:
 A-3
 B-2
 C-2
 D-3
 E-3
 F-2
 G-3

We have vertices A, D, E and G with

degree 3 and B,C and F with degree
2.
 COUNTING THE VERTICES,
EDGES AND FINDING THE
DEGREES
Graph H has 7 vertices and 9 edges
Listing the vertices and their degrees, we have:
 1-3
 2-2
 3-2
 4-2
 5-3
 6-3
 7-3

We have vertices 1,5,6 and 7 with

degree 3 and 2, 3 and 4 with degree 2.
 SOLUTION
Both graphs have seven vertices and 9 edges.
They also both have four vertices of degree three and three vertices of
degree two.
We define an injection from the vertices of G to the vertices of H that
preserves the degree of the vertices.
Then, we will determine whether it is an isomorphism.
The function with s a one-to-one correspondence between the two
graphs.
To show that preserves edges we construct adjacency matrices A G and
AH.
AG =

AH =
Because AG=AH, it follows that f preserves edges.
We conclude that is an isomorphism.
So, G and H are isomorphic.
THANK YOU!