| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4656423 | Journal of Combinatorial Theory, Series A | 2006 | 13 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
