On Commuting Graphs for Elements of Order 3 in Symmetric Groups

Athirah Nawawi, Peter Rowley


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$.


Commuting graph, Symmetric group, Order 3 elements, Diameter

Full Text: