It is not difficult to construct dense graphs containing Hamiltonian cycles, but it is difficult to generate dense graphs that are guaranteed to contain a unique Hamiltonian cycle. This article presents an algorithm for generating arbitrarily large simple graphs containing "unique" Hamiltonian cycles. These graphs can be turned into dense graphs…

In this article, a simple exercise for finding groups isomorphic to the symmetry group of the real line is presented. A mechanism for producing metrics on the real line is used to construct the group elements, and these transformations, by construction, are isometries with respect to the generating metric.

A procedure for generating quasigroups from groups is described, and the properties of these derived quasigroups are investigated. Some practical examples of the procedure and related results are presented.

In this paper, two classes of graphs of arbitrary order are described which contain unique Hamiltonian cycles. All the graphs have mean vertex degree greater than one quarter the order of the graph. The Hamiltonian cycles are detailed, their uniqueness proved and simple rules for the construction of the adjacency matrix of the graphs are given.…