Hostname: page-component-7dd5485656-gs9qr Total loading time: 0 Render date: 2025-10-31T23:20:35.920Z Has data issue: false hasContentIssue false
  • English
  • Français

The number of Hamiltonian circuits in large, heavily edged graphs

Published online by Cambridge University Press:  18 May 2009

J. Sheehan  and
E. M. Wright
J. Sheehan
Affiliation:
University of Aberdeen, Aberdeen, U.K.
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.

G is a graph on n nodes with q edges, without loops or multiple edges. We write α = q/n and β for the maximum degree of any node of G. We write

and H for the number of Hamiltonian circuits (H.c.) in the complement of G, or, what is the same thing, the number of those H.c. in the complete graph Kn which have no edge in common with G. Our object here is to prove the following theorem.

Information

Type
Research Article
Information
Glasgow Mathematical Journal , Volume 18 , Issue 1 , January 1977 , pp. 35 - 37
Copyright
Copyright © Glasgow Mathematical Journal Trust 1977

References

REFERENCES

1.Kasai, T., Shintani, H. and Imai, M., Number of Hamiltonian circuits in basic series of incomplete graphs, Bull. Univ. Osaka Prefecture Ser. A 20 (1971), No. 2, 245–260. MR 46, No. 8908.Google Scholar
2.Rousseau, C. C., An enumeration problem concerning Hamiltonian cycles, Report 73–18, Department of Mathematics, Memphis State University.Google Scholar
3.Singmaster, D., oral communication.Google Scholar
4.Wright, E. M., For how many edges is a graph almost certainly Hamiltonian?, J. London Math. Soc. (2) 8 (1974), 44–48.CrossRefGoogle Scholar