著者

小林 みどり 武藤 伸明 中村 義作

出版者

静岡県立大学

雑誌

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

巻号頁・発行日

vol.14, no.2, pp.37-40, 2002-03-25

---

A set of Hamilton cycles in the complete graph K_n is called a λ-ply Dudeney set if every path of length two lies on exactly λ of the cycles. The problem of constructing a λ-ply Dudeney set in Kn has been solved when n is even, but it is still open when n is odd. In this paper, we construct a λ-ply Dudeney set in Kn, where λ=n-3 when n=4k + 3 (k ≥ 1), and II^<e-1>_<i=0>(2^<e-i>k_1-2) when n=2^ek_1+1 ≥ 5 (e ≥ 1, k_1 is odd).