Graphical complexity of products of permutation groups |
| |
| Authors: | Mariusz Grech |
| |
| Affiliation: | Institute of Mathematics, University of Wroc?aw, pl. Grunwaldzki 2/4, 50-384 Wroc?aw, Poland |
| |
| Abstract: | In this paper we study representations of permutation groups as automorphism groups of colored graphs and supergraphs. In particular, we consider how such representations for various products of permutation groups can be obtained from representations of factors and how the degree of complexity increases in such constructions. |
| |
| Keywords: | Colored graph Automorphism group Permutation group Supergraph Direct product Wreath product |
| 本文献已被 ScienceDirect 等数据库收录！ |
