Frucht's theorem for the digraph factorial

DOI10.7151/DMGT.1661MaRDI QIDQ2860862zbMATH OpenOpenAlexFDO

Authors Richard H. Hammack

Publication date 11 November 2013

Published in Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.7151/dmgt.1661

zbMATH Keywords

digraphsgraph automorphismsdigraph factorialFrucht's theorem

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Direct product of automorphism groups of digraphs
• Permutation groups on unordered sets. II: On a theorem of Frucht
• On the automorphism groups of edge-coloured digraphs
• scientific article; zbMATH DE number 4061277
• Simple graphs containing induced subgraphs whose automorphism groups are isomorphic to subgroups of a given finite group

Cited in

(1)

• Frucht's theorem in Borel setting

This page was built for publication: Frucht's theorem for the digraph factorial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2860862)