Automorphism groups of graphs with forbidden subgraphs (Q1199116)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Automorphism groups of graphs with forbidden subgraphs |
scientific article |
Statements
Automorphism groups of graphs with forbidden subgraphs (English)
0 references
16 January 1993
0 references
For a graph \(G\) let \(F(G)\) be the class of finite graphs which do not contain an induced subgraph isomorphic to \(G\). If \(G\) is not isomorphic to a path on at most 4 vertices or to the complement of such a graph, then for every finite group \(H\) there is a graph \(\Gamma\) such that \(H\) is isomorphic to the automorphism group of \(\Gamma\). For all paths \(G\) on at most 4 vertices the automorphism groups of graphs in \(F(G)\) are described.
0 references
forbidden subgraph
0 references
automorphism group
0 references