Direct product of automorphism groups of colored graphs

被引：12

作者：

Grech, M ^{[1
]}

Kisielewicz, A ^{[1
]}

机构：

[1] Univ Wroclaw, Inst Math, PL-50384 Wroclaw, Poland

来源：

DISCRETE MATHEMATICS | 2004年 / 283卷 / 1-3期

关键词：

colored graph; automorphism group; direct product;

D O I：

10.1016/j.disc.2003.11.008

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

The concrete representation problem asks if a permutation group G on a set X is equal (permutation isomorphic) to the automorphism group of some colored graph with vertex set X. In this paper we consider how the representability of the direct product of permutation groups is connected with the representability of the factors. (C) 2003 Elsevier B.V. All rights reserved.

引用

页码：81 / 86

页数：6

共 7 条

[1]

[Anonymous], HDB COMBINATORICS

[2] Symmetry groups of Boolean functions and constructions of permutation groups [J].