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
Graphs of groups were first introduced by Jean-Pierre Serre in his book entitled Arbres, Amalgames, ...
Abstract. We introduce a combinatorial version of Stallings-Bestvina-Feighn-Dunwoody folding sequenc...
AbstractA graph with n edges is called harmonious if it is possible to label the vertices with disti...
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 ...
In 1980, about 20 years after sequenceable groups were introduced by Gordon to construct row-complet...
AbstractThe genus of the graph of any less-than-one-24th group, in the sense of Greendlinger, all of...
AbstractA group is called harmonious if its elements can be arranged in a sequence such that the pro...
AbstractWe consider the following generalization of the concept of harmonious graphs. Given a graph ...
Since the ancient determination of the five platonic solids the study of symmetry and regularity has...
A finite group is called Pn-sequenceable if its nonidentity elements can be listed x1 , x2 , ..., xk...
Since the ancient determination of the five platonic solids the study of symmetry and regularity has...
Since the ancient determination of the five platonic solids the study of symmetry and regularity has...
AbstractA graph G with q edges is said to be harmonious if there is an injection f from the vertices...
Graph theory is a crucial topic in the field of discrete mathematics and graph colouring or group la...
Graphs of groups were first introduced by Jean-Pierre Serre in his book entitled Arbres, Amalgames, ...
Abstract. We introduce a combinatorial version of Stallings-Bestvina-Feighn-Dunwoody folding sequenc...
AbstractA graph with n edges is called harmonious if it is possible to label the vertices with disti...
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 ...
In 1980, about 20 years after sequenceable groups were introduced by Gordon to construct row-complet...
AbstractThe genus of the graph of any less-than-one-24th group, in the sense of Greendlinger, all of...
AbstractA group is called harmonious if its elements can be arranged in a sequence such that the pro...
AbstractWe consider the following generalization of the concept of harmonious graphs. Given a graph ...
Since the ancient determination of the five platonic solids the study of symmetry and regularity has...
A finite group is called Pn-sequenceable if its nonidentity elements can be listed x1 , x2 , ..., xk...
Since the ancient determination of the five platonic solids the study of symmetry and regularity has...
Since the ancient determination of the five platonic solids the study of symmetry and regularity has...
AbstractA graph G with q edges is said to be harmonious if there is an injection f from the vertices...
Graph theory is a crucial topic in the field of discrete mathematics and graph colouring or group la...
Graphs of groups were first introduced by Jean-Pierre Serre in his book entitled Arbres, Amalgames, ...
Abstract. We introduce a combinatorial version of Stallings-Bestvina-Feighn-Dunwoody folding sequenc...
AbstractA graph with n edges is called harmonious if it is possible to label the vertices with disti...