Question: Two graphs G1 = (V1, E1) and G2 = (V2, E2), such that V1 = V2 = {1, 2, , n} are isomorphic if there

Two graphs G1 = (V1, E1) and G2 = (V2, E2), such that V1 = V2 = {1, 2, , n} are isomorphic if there is a one-one, onto function : {1, 2, , n} {1, 2, , n} such that for every i, j {1, 2, , n}

E1 <(i), (j)> E2

Show that the following decision problem in in NP.

Problem: Isomorphism Input

Instance: Two graphs G1 = (V1, E1) and G2 = (V2, E2) where V1 = V2 = {1, 2, , n}

Decision: Are G1 and G2 isomorphic?

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!