Graph enumeration
This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Graph_enumeration".

Graph enumeration is a subject of graph theory that deals with the problems of the following type: find how many non-isomorphic graphs have a given property.

See Pólya enumeration theorem for examples.

References

• Frank Harary and Edgar M. Palmer (1973). Graphical Enumeration. Academic Press . ISBN 0123242452. 

This combinatorics-related article is a stub. You can help Wikipedia by expanding it.