著者

小林 みどり 喜安 善市 林田 侃

出版者

静岡県立大学

雑誌

経営と情報 : 静岡県立大学・経営情報学部/学報 (ISSN:09188215)

巻号頁・発行日

vol.9, no.2, pp.1-3, 1997-03-28

---

A set of Hamilton cycles in the complete graph on n vertices is called a Dudeney set, if every path of length two lies on exactly one of the cycles. It has been conjectured that there is a Dudeney set for every complete graph, but it is still unsettled. Furthermore, little is known about the number of non-isomorphic Dudeney sets. In the previous paper, we constructed two types of new Dudeney sets using perfect 1-factorizations and determined the numbers of these Dudeney sets. In this paper, we show Dudeney sets of these types are not isomorphic, so the number of them are determined.