SUPERGRAPHS AND GRAPHICAL COMPLEXITY OF PERMUTATION GROUPS

被引：0

作者：

Kisielewicz, Andrzej ^{[1
]}

机构：

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

来源：

ARS COMBINATORIA | 2011年 / 101卷

关键词：

AUTOMORPHISM-GROUPS; DIRECT-PRODUCT;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

This paper introduces the concepts of a supergraph and graphical complexity of a permutation group, intended as a tool for investigating the structure of concrete permutation groups. Basic results are established and some research problems suggested.

引用

页码：193 / 207

页数：15

共 15 条

[1]

[Anonymous], HDB COMBINATORICS

[2]

Cameron P. J., 1995, HDB COMBINATORICS, V1, P611

[3]

Dixon J. D., 1996, GRADUATED TEXTS MATH, V163

[4] Direct product of automorphism groups of colored graphs [J].

Grech, M ;

Kisielewicz, A .

DISCRETE MATHEMATICS, 2004, 283 (1-3) :81-86

[5]

GRECH M, GRAPHICAL C IN PRESS

[6]

Kalunin L. A., 1976, Latviisk Mat. Eegodnik, V18, P81

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

Kisielewicz, A .

JOURNAL OF ALGEBRA, 1998, 199 (02) :379-403

[8]

KISIELEWICZ A, 2004, SUPERGRAPHS IDEAS RE

[9]

Klin M., 1988, ANGEW ALGEBRA MATH I

[10] Direct product and uniqueness of automorphism groups of graphs [J].

Peisert, W .

DISCRETE MATHEMATICS, 1999, 207 (1-3) :189-197

← 1 2 →