Frucht’s Theorem for the Digraph Factorial

Richard H. Hammack. "Frucht’s Theorem for the Digraph Factorial." Discussiones Mathematicae Graph Theory 33.2 (2013): 329-336. <http://eudml.org/doc/268178>.

@article{RichardH2013,
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. A new operation on digraphs was introduced recently as an aid in solving certain questions regarding cancellation over the direct product of digraphs. Given a digraph A, its factorial A! is certain digraph whose vertex set is the permutations of V (A). The arc set E(A!) forms a group, and the loops form a subgroup that is isomorphic to Aut(A). (So E(A!) can be regarded as an extension of Aut(A).) This note proves an analogue of Frucht’s theorem in which Aut(A) is replaced by the group E(A!). Given any finite group G, we show that there is a graph A for which E(A!) ∼= G.},
author = {Richard H. Hammack},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {Frucht’s theorem; digraphs; graph automorphisms; digraph factorial; Frucht's theorem},
language = {eng},
number = {2},
pages = {329-336},
title = {Frucht’s Theorem for the Digraph Factorial},
url = {http://eudml.org/doc/268178},
volume = {33},
year = {2013},
}

TY - JOUR
AU - Richard H. Hammack
TI - Frucht’s Theorem for the Digraph Factorial
JO - Discussiones Mathematicae Graph Theory
PY - 2013
VL - 33
IS - 2
SP - 329
EP - 336
AB - 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. A new operation on digraphs was introduced recently as an aid in solving certain questions regarding cancellation over the direct product of digraphs. Given a digraph A, its factorial A! is certain digraph whose vertex set is the permutations of V (A). The arc set E(A!) forms a group, and the loops form a subgroup that is isomorphic to Aut(A). (So E(A!) can be regarded as an extension of Aut(A).) This note proves an analogue of Frucht’s theorem in which Aut(A) is replaced by the group E(A!). Given any finite group G, we show that there is a graph A for which E(A!) ∼= G.
LA - eng
KW - Frucht’s theorem; digraphs; graph automorphisms; digraph factorial; Frucht's theorem
UR - http://eudml.org/doc/268178
ER -