 Graph enumeration

In combinatorics, an area of mathematics, graph enumeration describes a class of combinatorial enumeration problems in which one must count undirected or directed graphs of certain types, typically as a function of the number of vertices of the graph.These problems may be solved either exactly (as an algebraic enumeration problem) or asymptotically.