You are here: MIMS > EPrints
MIMS EPrints

## 2012.58: On commuting graphs for elements of order 3 in symmetric groups

2012.58: Athirah Nawawi and Peter Rowley (2012) On commuting graphs for elements of order 3 in symmetric groups. The Electronic Journal of Combinatorics.

Full text available as:

 PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader240 Kb

## Abstract

The commuting graph $\mathcal{C}(G,X)$, where $G$ is a group and $X$ is a subset of $G$, is the graph with vertex set $X$ and distinct vertices being joined by an edge whenever they commute. Here the diameter of $\mathcal{C}(G,X)$ is studied when $G$ is a symmetric group and $X$ a conjugacy class of elements of order $3$.

Item Type: Article Commuting graph, Symmetric group, Order 3 elements, Diameter MSC 2000 > 05 Combinatorics 2012.58 Mrs Athirah Nawawi 22 May 2012