(a) Let G = (V, E) be a loop-free undirected graph, where |V| = 6 and deg(v) = 2 for all v ∈ V, Up to isomorphism how many such graphs G are there?
(b) Answer part (a) for | V| -7.
(c) Let G1 = (V1, E1) be a loop-free undirected 3-regular graph with |V1| - 6. Up to isomorphism how many such graphs G1 are there?
(d) Answer part (c) for | V1| -1 and G1 4-regular.
(e) Generalize the results in parts (c) and (d).