UPM Institutional Repository

Commuting graphs, C(G, X) in symmetric groups Sym(n) and its connectivity


Nawawi @ Mohamed Nawawi, Athirah and Said Husain, Sharifah Kartini and Kamel Ariffin, Muhammad Rezal (2019) Commuting graphs, C(G, X) in symmetric groups Sym(n) and its connectivity. Symmetry, 11 (9). art. no. 1178. pp. 1-8. ISSN 2073-8994


A commuting graph is a graph denoted by C(G,X) where G is any group and X, a subset of a group G, is a set of vertices for C(G,X) . Two distinct vertices, x,y∈X , will be connected by an edge if the commutativity property is satisfied or xy=yx . This study presents results for the connectivity of C(G,X) when G is a symmetric group of degree n, Sym (n) , and X is a conjugacy class of elements of order three in G.

Download File

[img] Text
Restricted to Repository staff only

Download (243kB)
Official URL or Download Paper: https://www.mdpi.com/2073-8994/11/9/1178

Additional Metadata

Item Type: Article
Divisions: Faculty of Science
Institute for Mathematical Research
DOI Number: https://doi.org/10.3390/sym11091178
Publisher: MDPI
Keywords: Commuting graph; Symmetric group; Order 3 elements
Depositing User: Nabilah Mustapa
Date Deposited: 04 May 2020 16:08
Last Modified: 04 May 2020 16:08
Altmetrics: http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.3390/sym11091178
URI: http://psasir.upm.edu.my/id/eprint/38254
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item