Graph enumeration
From Wikipedia, the free encyclopedia
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
- Frank Harary and Edgar M. Palmer (1973). Graphical Enumeration. Academic Press . ISBN 0123242452.
.svg/30px-Encoder_Disc_(3-Bit).svg.png){kind=small}
