Graphical complexity of products of permutation groups

DOI10.1016/j.disc.2007.04.004zbMath1132.05031OpenAlexW2021669195MaRDI QIDQ2469992

Artur Jeż, Andrzej P. Kisielewicz, Grech, Mariusz

Publication date: 11 February 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.04.004

zbMATH Keywords

automorphism grouppermutation groupsupergraphdirect productwreath productcolored graph

Mathematics Subject Classification ID

Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15)

Related Items (8)

The graphical complexity of direct products of permutation groups ⋮ Wreath product in automorphism groups of graphs ⋮ 2-closed abelian permutation groups ⋮ Cyclic permutation groups that are automorphism groups of graphs ⋮ Direct product of automorphism groups of digraphs ⋮ Direct products of automorphism groups of graphs ⋮ Totally symmetric colored graphs ⋮ Decompositions of the automorphism groups of edge-colored graphs into the direct product of permutation groups

Cites Work

• Symmetry groups of Boolean functions and constructions of permutation groups
• Direct product and uniqueness of automorphism groups of graphs
• Direct product of automorphism groups of colored graphs
• Totally symmetric colored graphs
• All self-complementary symmetric graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Graphical complexity of products of permutation groups