Nawawi, Athirah and Rowley, Peter (2012) On commuting graphs for elements of order 3 in symmetric groups. The Electronic Journal of Combinatorics. (Submitted)
![[thumbnail of LatestCommutingGraphOrder3EltsSym.pdf]](https://eprints.maths.manchester.ac.uk/style/images/fileicons/application_pdf.png) |
PDF
LatestCommutingGraphOrder3EltsSym.pdf Download (245kB) |
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 |
|---|---|
| Uncontrolled Keywords: | Commuting graph, Symmetric group, Order 3 elements, Diameter |
| Subjects: | MSC 2010, the AMS's Mathematics Subject Classification > 05 Combinatorics |
| Depositing User: | Mrs Athirah Nawawi |
| Date Deposited: | 22 May 2012 |
| Last Modified: | 20 Oct 2017 14:13 |
| URI: | https://eprints.maths.manchester.ac.uk/id/eprint/1833 |
Actions (login required)
 |
View Item |