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

DOI10.26493/1855-3974.1926.6ADzbMATH Open1479.05362arXiv1903.07419OpenAlexW3178920288MaRDI QIDQ5020293FDOQ5020293

Authors: Mariusz Grech 

Publication date: 5 January 2022

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

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.

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

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

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)

Cites Work

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

Cited In (5)

• The graphical complexity of direct products of permutation groups
• Direct product of automorphism groups of digraphs
• Wreath product in automorphism groups of graphs
• On the automorphism groups of edge-coloured 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)