Frucht’s Theorem for the Digraph Factorial

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.

Bibliographic Details
Main Author: Hammack Richard H.
Format: Article
Language:English
Published: University of Zielona Góra 2013-05-01
Series:Discussiones Mathematicae Graph Theory
Subjects:
Online Access:https://doi.org/10.7151/dmgt.1661
_version_ 1797717996218613760
author Hammack Richard H.
author_facet Hammack Richard H.
author_sort Hammack Richard H.
collection DOAJ
description 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.
first_indexed 2024-03-12T08:44:33Z
format Article
id doaj.art-172b026e0ac04694b06907b0baddef6c
institution Directory Open Access Journal
issn 2083-5892
language English
last_indexed 2024-03-12T08:44:33Z
publishDate 2013-05-01
publisher University of Zielona Góra
record_format Article
series Discussiones Mathematicae Graph Theory
spelling doaj.art-172b026e0ac04694b06907b0baddef6c2023-09-02T16:30:01ZengUniversity of Zielona GóraDiscussiones Mathematicae Graph Theory2083-58922013-05-0133232933610.7151/dmgt.1661Frucht’s Theorem for the Digraph FactorialHammack Richard H.0Department of Mathematics and Applied Mathematics Virginia Commonwealth University Richmond, VA 23284 USATo 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.https://doi.org/10.7151/dmgt.1661frucht’s theoremdigraphsgraph automorphismsdigraph factorial
spellingShingle Hammack Richard H.
Frucht’s Theorem for the Digraph Factorial
Discussiones Mathematicae Graph Theory
frucht’s theorem
digraphs
graph automorphisms
digraph factorial
title Frucht’s Theorem for the Digraph Factorial
title_full Frucht’s Theorem for the Digraph Factorial
title_fullStr Frucht’s Theorem for the Digraph Factorial
title_full_unstemmed Frucht’s Theorem for the Digraph Factorial
title_short Frucht’s Theorem for the Digraph Factorial
title_sort frucht s theorem for the digraph factorial
topic frucht’s theorem
digraphs
graph automorphisms
digraph factorial
url https://doi.org/10.7151/dmgt.1661
work_keys_str_mv AT hammackrichardh fruchtstheoremforthedigraphfactorial