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.
Zhenhong LiuYongjin ZhuFeng Tian
Jan GoedgebeurBarbara MeersmanCarol T. Zamfirescu