Draw all nonisomorphic graphs with six vertices, all having degree 2.

Draw all nonisomorphic graphs with six vertices, all having degree 2.

Given information:

nonisomorphic graphs with six vertices, all having degree 2.

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 such that

[u,v] is an edge in G⇔[g(u),g(v)] is an edge of G′.

We are interested in all nonisomorphic simple graphs with 6 vertices of degree 2 each