Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-19T03:26:25.044Z Has data issue: false hasContentIssue false

The Number of -Coloured Graphs

Published online by Cambridge University Press:  20 November 2018

David A. Klarner*
Affiliation:
McMaster University, Hamilton, Ontario; Technical University, Eindhoven, The Netherlands
Rights & Permissions [Opens in a new window]

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.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1968