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$.
@article{10_37236_2362,
author = {Athirah Nawawi and Peter Rowley},
title = {On commuting graphs for elements of order 3 in symmetric groups},
journal = {The electronic journal of combinatorics},
year = {2015},
volume = {22},
number = {1},
doi = {10.37236/2362},
zbl = {1307.05111},
url = {http://geodesic.mathdoc.fr/articles/10.37236/2362/}
}
TY - JOUR
AU - Athirah Nawawi
AU - Peter Rowley
TI - On commuting graphs for elements of order 3 in symmetric groups
JO - The electronic journal of combinatorics
PY - 2015
VL - 22
IS - 1
UR - http://geodesic.mathdoc.fr/articles/10.37236/2362/
DO - 10.37236/2362
ID - 10_37236_2362
ER -
%0 Journal Article
%A Athirah Nawawi
%A Peter Rowley
%T On commuting graphs for elements of order 3 in symmetric groups
%J The electronic journal of combinatorics
%D 2015
%V 22
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/2362/
%R 10.37236/2362
%F 10_37236_2362
Athirah Nawawi; Peter Rowley. On commuting graphs for elements of order 3 in symmetric groups. The electronic journal of combinatorics, Tome 22 (2015) no. 1. doi: 10.37236/2362
