No CrossRef data available.
Article contents
The Number of 
-Coloured Graphs
Published online by Cambridge University Press: 20 November 2018
Extract
Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
In this paper we describe an algorithm for finding the number of non-isomorphic -coloured graphs with n nodes and e edges. We use Pόlya's fundamental enumeration theorem (in a form similar to that given by de Bruijn (see 1)) which reduces the problem to finding the cycle index for a certain permutation group. Harary (3) followed this same program for bi-coloured graphs, but failed to find the cycle index of the relevant group for general -coloured graphs.
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1968
Footnotes
This paper was written while the author was a post-doctoral fellow at McMaster University, Hamilton, Ontario, Canada, 1967.
References
1.
Beckenbach, Edwin F. (editor), Applied combinatorial mathematics, Chapter 5, “Pôlya's theory of counting”, by de Bruijn, N. G. pp. 144–184 (Wiley, New York, 1964).Google Scholar
2.
de Bruijn, N. G.
Generalization of Pôlya's fundamental theorem in enumerative combinatorial analysis, Nederl. Akad. Wetensch. Proc. Ser. A 62 Indag. Math. 21 (1959), 59–69.Google Scholar
3.
Harary, F., On the number of bi-colored graphs, Pacific J. Math. 8 (1958), 743–755.Google Scholar
4.
Read, R. C., The number of k-coloured graphs on labelled nodes, Can. J. Math. 12 (1960), 410–414.Google Scholar
5.
Robinson, R. W., Enumeration of colored graphs, J. Combinatorial Theory 4 (1968), 181–190.Google Scholar
You have
Access