For each pair of graphs G and G’ in 1-5, determine whether G and G’ are isomorphic. If they are, give functions g: V(G) → V(G’) and h:E(G) → E(G’) that define the isomorphism. If they are not, give an invariant for graph isomorphism that they do not share.

Whether G and G′ are isomorphic. If they are, give functions g:V(G)→V(G′) and h:E(G)→E(G′) that define the isomorphism. If they are not, give an invariant for graph isomorphism that they do not share.

Given information:

Calculation:

Two graphs are G and G′ (with vertices V ( G ) and V(G′) respectively and edges E ( G ) and E(G′) respectively) are isomorphic if there exists one-to-one correspondence

g:V(G)→V(G') and h:E(G)→E(G') such that v is an endpoint of e⇔g(v) is an endpoint of h(e). 

V(G) are all vertices of the graph GV(G′)are all vertices of the graph G′E(G) are all edges of the graph GE(G′) are all edges of the graph G′

V(G)={v1,v2,v3</