Sabidussi-type theorems for stability

Abstract

In this note we give details of a method by which we can produce an index-0 graph from any unstable graph and use it to show that given any finite group there exists an index-0 graph whose automorphism group is isomorphic, as an abstract group, to the given group. We proceed to construct two infinite families of connected index-0 graphs with connected complements whose automorphism group contains a transposition. This enables us to produce, for any finite group G, an index-0 graph whose automorphism group, isomorphic as an abstract group to C2 × G, contains a transposition.