Hostname: page-component-76fb5796d-25wd4 Total loading time: 0 Render date: 2024-04-27T04:06:05.358Z Has data issue: false hasContentIssue false
  • English
  • Français

Euler Graphs on Labelled Nodes

Published online by Cambridge University Press:  20 November 2018

Ronald C. Read
Ronald C. Read*
Affiliation:
University College of the West Indies
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 shall derive a concise formula for the number of Euler graphs on n labelled nodes and k edges. An Euler graph is a connected graph in which every node has even valency, where by the valency of a node is meant the number of edges which are incident with that node. Throughout most of the paper we shall be dealing with graphs whose nodes have even valencies but which may or may not be connected. For convenience we shall refer to these graphs as Euler graphs, although the usage is not, strictly speaking, correct. We shall impose the condition of connectedness in § 4.

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 14 , 1962 , pp. 482 - 486
Copyright
Copyright © Canadian Mathematical Society 1962