Skip to main content Accessibility help
×
Home
Hostname: page-component-65d66dc8c9-vx887 Total loading time: 0.2 Render date: 2021-09-28T19:42:05.433Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": true, "newCiteModal": false, "newCitedByModal": true, "newEcommerce": true, "newUsageEvents": true }

The Number of k-Coloured Graphs on Labelled Nodes

Published online by Cambridge University Press:  20 November 2018

R. C. Read*
Affiliation:
University College of the West Indies
Rights & Permissions[Opens in a new window]

Extract

HTML view is not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

By a labelled graph we shall mean a set of “nodes,“ distinguishable from one another and denoted by A1, A2 , …, and a collection of “edges” viz., pairs of nodes. We say that an edge “joins” the pair of nodes which specifies it. We further stipulate that at most one edge joins any two nodes, and that no edge joins a node to itself.

By a “colouring” of a graph in k colours we shall mean a mapping of the nodes of the graph onto a set of k colours C1, C2, …, Ck such that no two nodes which are joined by an edge are mapped onto the same colour. A graph so coloured in exactly k colours will be called a k-coloured graph. Since it is usually possible to colour a graph in more than one way, there will, in general, be many k-coloured graphs corresponding to a given graph.

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1960

References

1. Whitney, H., A Logical expansion in mathematics, Bull. Amer. Math. Soc, 54 (1932), 339362.CrossRefGoogle Scholar
2. Gilbert, E.N., Enumeration of labelled graphs, Can. J. Math., 5 (1956), 405411.CrossRefGoogle Scholar
You have Access
15
Cited by

Linked content

Please note a has been issued for this article.

Send article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

The Number of k-Coloured Graphs on Labelled Nodes
Available formats
×

Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

The Number of k-Coloured Graphs on Labelled Nodes
Available formats
×

Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

The Number of k-Coloured Graphs on Labelled Nodes
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *