Frucht’s Theorem for the Digraph Factorial
Discussiones Mathematicae Graph Theory, Tome 33 (2013) no. 2, p. 329.
Voir la notice de l'article dans European Digital Mathematics Library
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.
Classification :
05C20, 05C25, 05C60, 05C76
Mots-clés : Frucht’s theorem, digraphs, graph automorphisms, digraph factorial, Frucht's theorem
Mots-clés : Frucht’s theorem, digraphs, graph automorphisms, digraph factorial, Frucht's theorem
@article{DMGT_2013__33_2_268178, author = {Richard H. Hammack}, title = {Frucht{\textquoteright}s {Theorem} for the {Digraph} {Factorial}}, journal = {Discussiones Mathematicae Graph Theory}, pages = {329}, publisher = {mathdoc}, volume = {33}, number = {2}, year = {2013}, zbl = {1292.05133}, language = {en}, url = {https://geodesic-test.mathdoc.fr/item/DMGT_2013__33_2_268178/} }
Richard H. Hammack. Frucht’s Theorem for the Digraph Factorial. Discussiones Mathematicae Graph Theory, Tome 33 (2013) no. 2, p. 329. https://geodesic-test.mathdoc.fr/item/DMGT_2013__33_2_268178/