On diameters estimations of the commuting graphs of Sylow -subgroups of the symmetric groups

Keywords:
commuting graph, wreath product, Sylow -subgroup, symmetric group
Published online:
2013-06-20
Abstract
The commuting graph of a group is an undirected graph whose vertices are non-central elements of and two distinct vertices are adjacent if and only if . This article deals with the properties of the commuting graphs of Sylow -subgroups of the symmetric groups. We define conditions of connectedness of respective graphs and give estimations of the diameters if graph is connected.
How to Cite
(1)
Leshchenko, Y.; Zoria, L. On Diameters Estimations of the Commuting Graphs of Sylow -Subgroups of the Symmetric Groups. Carpathian Math. Publ. 2013, 5, 70-78.