AbstractFinite groups may be classified as to whether or not they have regular representations as automorphism groups of graphs. Such a classification is begun here for non-Abelian groups (classification of Abelian groups being already in the literature) with a classification of the dihedral groups, the groups of order p3 for p an odd prime (except for one group of order 27), and the generalized dicyclic groups. It is further shown that the class of groups (other than C2) having the above regular representations is closed under the operation of direct product
An automorphism of finite graph G is a permutation on its vertex set that conserves adjacency. The s...
AbstractLet Cay(G,S) be a connected tetravalent Cayley graph on a regular p-group G and let Aut(G) b...
AbstractA directed Cayley graphXis called a digraphical regular representation (DRR) of a groupGif t...
AbstractFinite groups may be classified as to whether or not they have regular representations as au...
AbstractA new method for the construction of graphs with given regular group is developed and used t...
AbstractA group G is said to have a graphical regular representation if there exists a simple graph ...
In spite of the difficulties which arise in constructing Cayley graphs with given regular automorphi...
AbstractIn this paper it is shown that no finite (undirected) graph can have a faithful, transitive ...
AbstractWe construct a degree 32 Cayley graph whose automorphism group contains two nonconjugate reg...
AbstractA new method for the construction of graphs with given regular group is developed and used t...
Let G be a group generated by elements x and y such that x2 = yp = e, where p is an odd prime. Let X...
AbstractThis paper is a continuation of [1] and we shall use the same terminology. The main result o...
AbstractA given group G may or may not have the property that there exists a graph X such that the a...
We prove that, given an infinite group G there is a directed graph X such that its automorphism grou...
AbstractIt is shown that for any given finite permutation group P there exist (infinitely many non-i...
An automorphism of finite graph G is a permutation on its vertex set that conserves adjacency. The s...
AbstractLet Cay(G,S) be a connected tetravalent Cayley graph on a regular p-group G and let Aut(G) b...
AbstractA directed Cayley graphXis called a digraphical regular representation (DRR) of a groupGif t...
AbstractFinite groups may be classified as to whether or not they have regular representations as au...
AbstractA new method for the construction of graphs with given regular group is developed and used t...
AbstractA group G is said to have a graphical regular representation if there exists a simple graph ...
In spite of the difficulties which arise in constructing Cayley graphs with given regular automorphi...
AbstractIn this paper it is shown that no finite (undirected) graph can have a faithful, transitive ...
AbstractWe construct a degree 32 Cayley graph whose automorphism group contains two nonconjugate reg...
AbstractA new method for the construction of graphs with given regular group is developed and used t...
Let G be a group generated by elements x and y such that x2 = yp = e, where p is an odd prime. Let X...
AbstractThis paper is a continuation of [1] and we shall use the same terminology. The main result o...
AbstractA given group G may or may not have the property that there exists a graph X such that the a...
We prove that, given an infinite group G there is a directed graph X such that its automorphism grou...
AbstractIt is shown that for any given finite permutation group P there exist (infinitely many non-i...
An automorphism of finite graph G is a permutation on its vertex set that conserves adjacency. The s...
AbstractLet Cay(G,S) be a connected tetravalent Cayley graph on a regular p-group G and let Aut(G) b...
AbstractA directed Cayley graphXis called a digraphical regular representation (DRR) of a groupGif t...