The connectivity of commuting graphs

被引：35

作者：

Bundy, D. ^{[1
]}

机构：

[1] Univ Kiel, Math Seminar, D-24098 Kiel, Germany

来源：

JOURNAL OF COMBINATORIAL THEORY SERIES A | 2006年 / 113卷 / 06期

关键词：

commuting graph; symmetric group;

D O I：

10.1016/j.jcta.2005.09.003

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A necessary and sufficient condition is proven for the connectivity of commuting graphs C(G, X), where G is Sym(n), the symmetric group of degree n, and X is any G-conjugacy class. (c) 2005 Elsevier Inc. All rights reserved.

引用

页码：995 / 1007

页数：13

共 4 条

[1] Commuting involution graphs for symmetric groups [J].

Bates, C ;

Bundy, D ;

Perkins, S ;

Rowley, P .

JOURNAL OF ALGEBRA, 2003, 266 (01) :133-153

[2]

BATES C, NOTE COMMUTING GRAPH

[3] FINITE GROUPS GENERATED BY 3-TRANSPOSITIONS .1. [J].

FISCHER, B .

INVENTIONES MATHEMATICAE, 1971, 13 (03) :232-&

[4] Finite quotients of the multiplicative group of a finite dimensional division algebra are solvable [J].

Rapinchuk, AS ;

Segev, Y ;

Seitz, GM .

JOURNAL OF THE AMERICAN MATHEMATICAL SOCIETY, 2002, 15 (04) :929-978

← 1 →