This worksheet explains how Polya counting is used to produce generating functions for the number of graphs with n vertices and different numbers of edges. An algorithm that works for both directed and undirected graphs is provided.
Curtis Bright
Dr. Giuseppe Guarino
Dr. David Harrington
Bruno Guerrieri
Maplesoft