Tournaments With a Given Automorphism Group
1964 ◽
Vol 16
◽
pp. 485-489
◽
Keyword(s):
The set of all adjacency-preserving automorphisms of the vertex set of a graph form a group which is called the (automorphism) group of the graph. In 1938 Frucht (2) showed that every finite group is isomorphic to the group of some graph. Since then Frucht, Izbicki, and Sabidussi have considered various other properties that a graph having a given group may possess. (For pertinent references and definitions not given here see Ore (4).) The object in this paper is to treat by similar methods a corresponding problem for a class of oriented graphs. It will be shown that a finite group is isomorphic to the group of some complete oriented graph if and only if it has an odd number of elements.
1986 ◽
Vol 40
(2)
◽
pp. 253-260
◽
Keyword(s):
Keyword(s):
Keyword(s):
2011 ◽
Vol 331
(1)
◽
pp. 482-489
◽
Keyword(s):
Keyword(s):
2018 ◽
Vol 17
(07)
◽
pp. 1850122
◽
1973 ◽
Vol 9
(3)
◽
pp. 363-366
◽
Keyword(s):