Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: digraph factorial

Sortuj według:

Ogranicz wyniki do:

Frucht’s Theorem for the Digraph Factorial

100%

Hammack R. H.

Discussiones Mathematicae Graph Theory

2013

tom 33

nr 2

329-336

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.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Hammack R. H.

1 2013

Wyniki wyszukiwania

Frucht’s Theorem for the Digraph Factorial