AbstractIn 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
A finite group is called Pn-sequenceable if its nonidentity elements can be listed x1 , x2 , ..., xk...
AbstractThis paper is inspired by the paper Some Canonical Sequences of Integers by Bernstein and Sl...
University of Minnesota M.S. thesis. May 2015. Major: Applied and Computational Mathematics. Advisor...
In this paper we introduce a method of sequencing the elements of a finite group that gives rise to ...
AbstractIn this paper we introduce a method of sequencing the elements of a finite group that gives ...
AbstractA group is called harmonious if its elements can be arranged in a sequence such that the pro...
AbstractA finite group G having n elements is said to be sequenceable if there exists an arrangement...
AbstractWe consider the following generalization of the concept of harmonious graphs. Given a graph ...
AbstractThe paper contains results about hamiltonian circuits and paths in Cayley graphs of finite g...
AbstractA graph G with q edges is said to be harmonious if there is an injection f from the vertices...
AbstractWe consider the following generalization of the concept of harmonious graphs. Given a graph ...
In 1980, about 20 years after sequenceable groups were introduced by Gordon to construct row-complet...
AbstractA graph G with q edges is said to be harmonious if there is an injection f from the vertices...
AbstractA graph with n edges is called harmonious if it is possible to label the vertices with disti...
AbstractHopcroft and Krishnamoorthy (1983) have shown that the harmonious coloring problem is NP-com...
A finite group is called Pn-sequenceable if its nonidentity elements can be listed x1 , x2 , ..., xk...
AbstractThis paper is inspired by the paper Some Canonical Sequences of Integers by Bernstein and Sl...
University of Minnesota M.S. thesis. May 2015. Major: Applied and Computational Mathematics. Advisor...
In this paper we introduce a method of sequencing the elements of a finite group that gives rise to ...
AbstractIn this paper we introduce a method of sequencing the elements of a finite group that gives ...
AbstractA group is called harmonious if its elements can be arranged in a sequence such that the pro...
AbstractA finite group G having n elements is said to be sequenceable if there exists an arrangement...
AbstractWe consider the following generalization of the concept of harmonious graphs. Given a graph ...
AbstractThe paper contains results about hamiltonian circuits and paths in Cayley graphs of finite g...
AbstractA graph G with q edges is said to be harmonious if there is an injection f from the vertices...
AbstractWe consider the following generalization of the concept of harmonious graphs. Given a graph ...
In 1980, about 20 years after sequenceable groups were introduced by Gordon to construct row-complet...
AbstractA graph G with q edges is said to be harmonious if there is an injection f from the vertices...
AbstractA graph with n edges is called harmonious if it is possible to label the vertices with disti...
AbstractHopcroft and Krishnamoorthy (1983) have shown that the harmonious coloring problem is NP-com...
A finite group is called Pn-sequenceable if its nonidentity elements can be listed x1 , x2 , ..., xk...
AbstractThis paper is inspired by the paper Some Canonical Sequences of Integers by Bernstein and Sl...
University of Minnesota M.S. thesis. May 2015. Major: Applied and Computational Mathematics. Advisor...