Hostname: page-component-586b7cd67f-vdxz6 Total loading time: 0 Render date: 2024-11-24T14:22:39.961Z Has data issue: false hasContentIssue false
  • English
  • Français

Counting the circuits in a graph

Published online by Cambridge University Press:  22 September 2016

W. J. R. Eplett
W. J. R. Eplett*
Affiliation:
University of the Witwatersrand, Johannesburg, South Africa
Get access Rights & Permissions [Opens in a new window]

Extract

The idea of this article is to find a ‘simple’ expression for the number of circuits of length 7 in the directed graph illustrated; that is, a path along

the arcs of the graph which passes through each vertex exactly once and returns to the vertex from which it started.

Type
Research Article
Information
The Mathematical Gazette , Volume 61 , Issue 416 , June 1977 , pp. 126 - 129
Copyright
Copyright © Mathematical Association 1977

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1. Erdös,, P. On a problem in graph theory, Mathl Gaz. 47, 220–223 (No. 361, October 1963).Google Scholar