论文信息 - Enumeration of colored graphs

Enumeration of colored graphs

Abstract Colored graphs are enumerated by an application of Polya's counting theorem. The cycle indices of the appropriate permutation groups are determined by use of a slightly generalized version of Polya's composition theorem. The counting theorem, as well as the product and composition of permutation groups, is reviewed in our notation.

Robert W. Robinson

[1] F. Harary. THE NUMBER OF LINEAR, DIRECTED, ROOTED, AND CONNECTED GRAPHS , 1955 .

[2] J. H. Redfield,et al. The Theory of Group-Reduced Distributions , 1927 .

[3] Frank Harary,et al. On the number of bi-colored graphs. , 1958 .

[4] G. Pólya. Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen , 1937 .

[5] Frank Harary,et al. Enumeration of bicolourable graphs , 1963 .