A number of papers [l; 2; 3; 4] have dealt with the construction of finite graphs X whose automorphism group G(X) is isomorphic to a given finite group G. Examination of the graphs constructed in these papers shows the following two facts. (1) The graphs X have the property that for any two vertices x and y of X there is at most one 4>EG(X) which sends x into y ((1) is precisely the fact which is used in [l] and [2] to prove that G(X) actually is isomorphic to G).(2) The graphs X are modifications of Cayley color-groups of the given group G with respect to some set H of generators of G (cf. Definition 2 below) in the sense that the vertices and edges of the color-group are replaced by certain graphs (cf. Definition 3). It is the purpose of the present note to show that (1) implies (2) (Theorem 3).By a graph X we mean a finite set V together with a set £ of unordered pairs of distinct elements of V. We shall indicate unordered pairs by brackets. The elements of V are called the vertices of X, the elements of £ the edges of X. To distinguish between different graphs we shall always write V(X) for V, and E(X) for E. By G(X) we denote the automorphism group of X. We shall consider the elements of G(X) as permutations of the vertices of X. Definition 1. A graph X is strongly fixed-point-free, if G(X) ^ {1}, and 4>xt±x for every xE V(X) and every 4>EG(X) -{1J, where 1 is the identity of G(X).If X is strongly fixed-point-free, then clearly X is fixed-point-free
n 1938 Frucht (2) proved the following theorem:(1.1). Theorem. Given any finite group G there exist infinitely many
nonisomorphic connected graphs X whose automorphism group is isomorphic
to G.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.