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 (Solved)
1. f(u) and f(v) are contained in g but not contained in h
2. f(u) and f(v) are adjacent in h
3. f(u * v) = f(u) + f(v) d) f(u) = f(u)2 + f(v
4. 2
- b. f(u) and f(v) are adjacent in h