Commuting graphs, C(G, X) in symmetric groups Sym(n) and its connectivity
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(...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI
2019
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/38254/ http://psasir.upm.edu.my/id/eprint/38254/1/38254.pdf |
| _version_ | 1848848828454666240 |
|---|---|
| author | Nawawi @ Mohamed Nawawi, Athirah Said Husain, Sharifah Kartini Kamel Ariffin, Muhammad Rezal |
| author_facet | Nawawi @ Mohamed Nawawi, Athirah Said Husain, Sharifah Kartini Kamel Ariffin, Muhammad Rezal |
| author_sort | Nawawi @ Mohamed Nawawi, Athirah |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-15T09:40:42Z |
| format | Article |
| id | upm-38254 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T09:40:42Z |
| publishDate | 2019 |
| publisher | MDPI |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-382542020-05-04T16:08:06Z http://psasir.upm.edu.my/id/eprint/38254/ Commuting graphs, C(G, X) in symmetric groups Sym(n) and its connectivity Nawawi @ Mohamed Nawawi, Athirah Said Husain, Sharifah Kartini Kamel Ariffin, Muhammad Rezal 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. MDPI 2019 Article PeerReviewed text en http://psasir.upm.edu.my/id/eprint/38254/1/38254.pdf 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 https://www.mdpi.com/2073-8994/11/9/1178 10.3390/sym11091178 |
| spellingShingle | Nawawi @ Mohamed Nawawi, Athirah Said Husain, Sharifah Kartini Kamel Ariffin, Muhammad Rezal Commuting graphs, C(G, X) in symmetric groups Sym(n) and its connectivity |
| title | Commuting graphs, C(G, X) in symmetric groups Sym(n) and its connectivity |
| title_full | Commuting graphs, C(G, X) in symmetric groups Sym(n) and its connectivity |
| title_fullStr | Commuting graphs, C(G, X) in symmetric groups Sym(n) and its connectivity |
| title_full_unstemmed | Commuting graphs, C(G, X) in symmetric groups Sym(n) and its connectivity |
| title_short | Commuting graphs, C(G, X) in symmetric groups Sym(n) and its connectivity |
| title_sort | commuting graphs, c(g, x) in symmetric groups sym(n) and its connectivity |
| url | http://psasir.upm.edu.my/id/eprint/38254/ http://psasir.upm.edu.my/id/eprint/38254/ http://psasir.upm.edu.my/id/eprint/38254/ http://psasir.upm.edu.my/id/eprint/38254/1/38254.pdf |