Decompositions of the automorphism groups of edge-colored graphs into the direct product of permutation groups

DOI10.26493/1855-3974.1926.6ADMaRDI QIDQ5020293zbMATH OpenOpenAlexFDO

Authors Mariusz Grech

Publication date 5 January 2022

Published in Ars Mathematica Contemporanea (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1903.07419

zbMATH Keywords

colored graphautomorphism groupdirect productpermutation group

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Coloring of graphs and hypergraphs (05C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Group actions on combinatorial structures (05E18)

Abstract: In the paper Graphical complexity of products of permutation groups, M. Grech, A. Jez, A. Kisielewicz have proved that the direct product of automorphism groups of edge-colored graphs is itself the automorphism groups of an edge-colored graph. In this paper, we study the direct product of two permutation groups such that at least one of them fails to be the automorphism group of an edge-colored graph. We find necessary and sufficient conditions for the direct product to be the automorphism group of an edge-colored graph. The same problem is solved for the edge-colored digraphs.

Recommendations

• The graphical complexity of direct products of permutation groups
• Direct product of automorphism groups of digraphs
• Direct product and uniqueness of automorphism groups of graphs
• Cyclic automorphism groups of graphs and edge-colored graphs
• scientific article; zbMATH DE number 510773

Cites work

• scientific article; zbMATH DE number 3943825 (Why is no real title available?)
• scientific article; zbMATH DE number 3747160 (Why is no real title available?)
• scientific article; zbMATH DE number 556252 (Why is no real title available?)
• scientific article; zbMATH DE number 863496 (Why is no real title available?)
• All totally symmetric colored graphs
• Direct product and uniqueness of automorphism groups of graphs
• Direct product of automorphism groups of colored graphs
• Direct product of automorphism groups of digraphs
• Direct products of automorphism groups of graphs
• Finite digraphs with given regular automorphism groups
• Graph multiplication
• Graphical Regular Representations of Non-Abelian Groups, II
• Graphical complexity of products of permutation groups
• Homogeneous factorisations of complete graphs with edge-transitive factors
• Homogeneous factorisations of graphs and digraphs
• On graphical regular representations of direct products of groups
• On partitioning the orbitals of a transitive permutation group
• On products of graphs and regular groups
• On the action of non-Abelian groups on graphs
• Supergraphs and graphical complexity of permutation groups.
• The graphical complexity of direct products of permutation groups
• Totally symmetric colored graphs
• Transitive Permutation Groups Without Semiregular Subgroups

Cited in

(5)

• Wreath product in automorphism groups of graphs
• On the automorphism groups of edge-coloured digraphs
• The graphical complexity of direct products of permutation groups
• Direct product of automorphism groups of digraphs
• Direct product of automorphism groups of colored graphs

This page was built for publication: Decompositions of the automorphism groups of edge-colored graphs into the direct product of permutation groups

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