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(...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI
2019
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/38254/1/38254.pdf http://psasir.upm.edu.my/id/eprint/38254/ https://www.mdpi.com/2073-8994/11/9/1178 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|