Define isomorphic graphs. Show that the following two graphs are isomorphic.

0

3.5kviews

Define isomorphic graphs. Show that the following two graphs are isomorphic.

written 7.8 years ago by

teamques10 ★ 67k

modified 2.7 years ago by

pedsangini276 • 4.8k

enter image description here

Mumbai University > Computer Engineering > Sem 3 > Discrete Structures

Marks: 8 Marks

Year: May 2016

discrete mathematics

ADD COMMENT EDIT

1 Answer

0

242views

written 7.8 years ago by

teamques10 ★ 67k

A graph can exist in different forms having the same number of vertices, edges, and also the same edge connectivity. Such graphs are called isomorphic graphs. Two graphs G1 and G2 are said to be isomorphic if −

Their number of components (vertices and edges) is same.
Their edge connectivity …

Create a free account to keep reading this post.

and 2 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.