Determine if following graphs g and G' are isomorphic or not.

1.6kviews

written 7.9 years ago by

teamques10 ★ 68k

modified 2.9 years ago by

pedsangini276 • 4.8k

enter image description here

Mumbai University > Computer Engineering > Sem 3 > Discrete Structures

Marks: 8 Marks

Year: May 2015

discrete mathematics

ADD COMMENT EDIT

1 Answer

61views

written 7.9 years ago by

teamques10 ★ 68k

Number of vertices: both 5.

Number of edges: both 5.

Degrees of corresponding vertices: all degree 2.

Connectedness: Each is fully connected.

Number of connected components: Both 1.

Pairs of connected vertices: All correspond.

Number of loops: 0.

Number of parallel edges: 0.

Everything is equal and so the graphs are isomorphic.

enter image description here

ADD COMMENT EDIT

Please log in to add an answer.