Abstract
For a graph Ф letF(Ф) be the class of finite graphs which do not contain an induced subgraph isomorphic to Ф. We show that whenever Ф is not isomorphic to a path on at most 4 vertices or to the complement of such a graph then for every finite groupG there exists a graph ГєF(Ф) such thatG is isomorphic to the automorphism group of Г. For all paths д on at most 4 vertices we determine the class of all automorphism groups of members ofF(д).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Babai, L.: On the abstract group of automorphisms. In: Combinatorics (H.N.V. Temperley, ed.), pp. 1–40 Cambridge: Cambridge Univ. Press 1981
Behrendt, G.: Equivalence systems and generalized wreath products. Acta Sci. Math.54, 257–268 (1990)
Behrendt, G.: Automorphism groups of posets with forbidden subposets. Discrete Math. (to appear)
Cameron, P.J.: Automorphism groups of graphs. In: Selected Topics in Graph Theory 2 (L. W. Beineke and R.J. Wilson, eds.), pp. 89–127. London: Academic Press 1983
Corneil, D.G., Lerchs, H., Stewart Burlingham, L.: Complement reducible graphs. Discrete Appl. Math.3, 163–174 (1981)
Dixon, M., Fournelle, T.A.: Some properties of generalized wreath products. Comp. Math.52, 355–372 (1984)
Frucht, R.: Herstellung von Graphen mit vorgegebener abstrakter Gruppe. Comp. Math.6, 239–250 (1938)
Silcock, H.L.: Generalized wreath products and the lattice of normal subgroups of a group. Alg. Univ.7, 361–372 (1977)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Behrendt, G. Automorphism groups of graphs with forbidden subgraphs. Graphs and Combinatorics 8, 203–206 (1992). https://doi.org/10.1007/BF02349957
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02349957