Number of vertices: both 7.

Number of edges: both 9.

Degrees of vertices (B, C, F and 2, 3, 4) are 2 and reset of the vertices having degree 3 .

Connectedness: Each is fully connected.

Number of connected components: Both 1.

Pairs of connected vertices: All correspond.

Number of loops: 0.

Number of parallel edges: 0.

Everything is equal and so the graphs are isomorphic.

Also,

G={V, E} where V={A, B, C, D, E, F} and E={(A, B), (B, C), (C, D), (D, E), (E, F), (F, G), (G, A)}={e1, e2, e3, e4, e5, e6, e7}

G’= {V’, E’ } where V’={1, 2, 3, 4, 5, 6, 7} and E’={(1, 2), (2, 3), (3, 4), (4, 5), (5, 6), (6, 7), (7, 1)}= {e1’, e2’, e3’, e4’, e5’, e6’, e7’}

Construct 2 functions: f V->V’ and E->E’