Graph enumeration

From Wikipedia, the free encyclopedia

You have new messages (last change).

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.

[edit] References

Retrieved from "http://en.wikipedia.org../../../g/r/a/Graph_enumeration.html"