On commuting graphs for elements of order 3 in symmetric groups (Q2256118): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q703034 |
Changed an Item |
||
| Property / author | |||
| Property / author: Peter J. Rowley / rank | |||
Normal rank | |||
Revision as of 11:29, 20 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On commuting graphs for elements of order 3 in symmetric groups |
scientific article |
Statements
On commuting graphs for elements of order 3 in symmetric groups (English)
0 references
19 February 2015
0 references
Summary: 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\).
0 references
commuting graph
0 references
symmetric group
0 references
order 3 elements
0 references
diameter
0 references
