TY - JOUR
T1 - On graphs with regular groups
AU - Imrich, Wilfried
PY - 1975/10
Y1 - 1975/10
N2 - A new method for the construction of graphs with given regular group is developed and used to show that to every nonabelian group G of order 3k, k ≥ 4, there exists a graph X whose automorphism group is isomorphic to G and regular as a permutation group on the set of vertices of X.
AB - A new method for the construction of graphs with given regular group is developed and used to show that to every nonabelian group G of order 3k, k ≥ 4, there exists a graph X whose automorphism group is isomorphic to G and regular as a permutation group on the set of vertices of X.
UR - http://www.scopus.com/inward/record.url?scp=49549148321&partnerID=8YFLogxK
U2 - 10.1016/0095-8956(75)90082-9
DO - 10.1016/0095-8956(75)90082-9
M3 - Article
AN - SCOPUS:49549148321
SN - 0095-8956
VL - 19.1975
SP - 174
EP - 180
JO - Journal of Combinatorial Theory, Series B
JF - Journal of Combinatorial Theory, Series B
IS - 2
ER -