Direct product of automorphism groups of colored graphs

DOI10.1016/j.disc.2003.11.008zbMath1042.05050OpenAlexW1986838423MaRDI QIDQ1827773

Grech, Mariusz, Andrzej P. Kisielewicz

Publication date: 6 August 2004

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

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

zbMATH Keywords

Automorphism groupColored graphDirect product

Mathematics Subject Classification ID

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

Related Items (11)

The graphical complexity of direct products of permutation groups ⋮ Wreath product in automorphism groups of graphs ⋮ Graphical cyclic permutation groups ⋮ Graphical complexity of products of permutation groups ⋮ Cyclic automorphism groups of graphs and edge-colored graphs ⋮ Cyclic permutation groups that are automorphism groups of graphs ⋮ Direct product of automorphism groups of digraphs ⋮ Graphical representations of cyclic permutation groups ⋮ 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
• All self-complementary symmetric graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Direct product of automorphism groups of colored graphs