Polya enumeration theorem applied to graphs

This theorem is used to find the number of non-isomorphic graphs under the action of a given group.