Contents

-

Constructing Edge-labellings of Kn with Constant-length Hamilton Cycles

Scott O.Jones1, P.Mark Kayll2
1Milliman USA, Inc. 1301 Fifth Avenue, Suite 3800 Seattle WA 98040, USA
2Department of Mathematical Sciences University of Montana Missoula MT 59812-0864, USA

Abstract

We present an optimal algorithm to label the edges of a complete graph with integer lengths so that every Hamilton cycle has the same length. The algorithm is complete in the sense that every edge-labelling with this property is the output labelling of some run of this algorithm. Such edge-labellings are induced by half-integer vertex-labellings by adding the vertex labels on an edge’s ends to determine its label. The Fibonacci sequence arises in this connection.