In this paper we introduce a method of sequencing the elements of a finite group that gives rise to a complete mapping of the group. Our definition was motivated by the concept of a harmonious graph invented by Graham and Sloane. Our concept has several connections to graph theory and as an application we complete the characterization of elegant cycles begun by Chang, Hsu, and Rogers. Our definitions are also variations of the notion of an R-sequenceable group first introduced by Ringel in his solution of the map coloring problem for all compact 2-dimensional manifolds except the sphere and expanded upon by Friedlander, Gordon, and Miller.
Bibliographical noteFunding Information:
The authors are grateful to David Moulton for contributing some results. The authors were supported by the National Science Foundation (grant number DMS 8709428) and the National Security Agency (grant number MDA 904-88-H-2027). The work was done at the University of Minnesota, Duluth.