M

Mr. Dubey • 89.33K Points
Coach

Q. An isomorphism of graphs G and H is a bijection f the vertex sets of G and H. Such that any two vertices u and v of G are adjacent in G if and only if

(A) f(u) and f(v) are contained in g but not contained in h
(B) f(u) and f(v) are adjacent in h
(C) f(u * v) = f(u) + f(v)
(D) f(u) = f(u)2 + f(v2)
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Loading Comments....

Question analytics