Define isometric graphs. Show that following graphs are isomorphic.

3.8kviews

written 7.8 years ago by

teamques10 ★ 67k

modified 2.7 years ago by

sagarkolekar ★ 11k

discrete mathematics

ADD COMMENT EDIT

1 Answer

176views

written 7.8 years ago by

teamques10 ★ 67k

enter image description here

Isometric graphs:

Two graphs which contain the same number of graph vertices connected in the same way are said to be isomorphic. Formally, two graphs G and H with graph vertices Vn={1,2,...,n} are said to be isomorphic if there is a permutation p of Vn such that {u, v} is …

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.