The non-abelian tensor square graph associated to a symmetric group and its perfect code
A set of vertices and edges forms a graph. A graph can be associated with groups using the groups' properties for its vertices and edges. The set of vertices of the graph comprises the elements of the group, while the set of edges of the graph is the properties and requirements for the graph. A...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Horizon Research Publishing
2022
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/98755/1/AthirahZulkarnain2022_TheNonAbelianTensorSquare.pdf http://eprints.utm.my/id/eprint/98755/ http://dx.doi.org/10.13189/ms.2022.100219 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Teknologi Malaysia |
| Language: | English |
| Summary: | A set of vertices and edges forms a graph. A graph can be associated with groups using the groups' properties for its vertices and edges. The set of vertices of the graph comprises the elements of the group, while the set of edges of the graph is the properties and requirements for the graph. A non-abelian tensor square graph of a group is defined when its vertex set represents the non-tensor centre elements' set of G. Then, two distinguished vertices are connected by an edge if and only if the non-abelian tensor square of these two elements is not equal to the identity of the non-abelian tensor square. This study investigates the non-abelian tensor square graph for the symmetric group of order six. In addition, some properties of this group's non-abelian tensor square graph are computed, including the diameter, the dominating number, and the chromatic number. The perfect code for the non-abelian tensor square graph for a symmetric group of order six is also found in this paper. |
|---|