Frucht’s Theorem for the Digraph Factorial

Abstract

To every graph (or digraph) A, there is an associated automorphism group Aut(A). Frucht’s theorem asserts the converse association; that for any finite group G there is a graph (or digraph) A for which Aut(A) ∼= G.

Keywords

• frucht’s theorem
• digraphs
• graph automorphisms
• digraph factorial