2 Let G V E Graph Vertex Set Edge Set 16 Automorphisms Graph Count Number Inequivalent Col Q37063137

2. Let G- (V, E) be the graph with vertex set and edge set There are 16 automorphisms of this graph. (a) count the number of inequivalent colorings of the vertices of G using k colors, and (b) count the number of inequivalent ways to color the vertices of G in which 2 vertices are colored red, 2 vertices are colored blue, 2 vertices are colored green, and 2 vertices are colored

OR

 

OR