The conjugation degree on a set of metacyclic 3-groups and 5-groups with their related graphs
The conjugation degree on a set is the probability that an element of a group fixes a set, whereby the group action considered is conjugation. The conjugation degree on a set is a variation of the commutativity degree of a group, which is the probability that two randomly chosen elements in a group...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Thesis |
| 語言: | English |
| 出版: |
2018
|
| 主題: | |
| 在線閱讀: | http://eprints.utm.my/id/eprint/81407/1/SitiNorziahidayuAmzeePFS2018.pdf |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | The conjugation degree on a set is the probability that an element of a group fixes a set, whereby the group action considered is conjugation. The conjugation degree on a set is a variation of the commutativity degree of a group, which is the probability that two randomly chosen elements in a group commute. In this research, the presentation of metacyclic p-groups where p is an odd prime is used. Meanwhile, the set considered is a set of an ordered pair of commuting elements in the metacyclic p-groups, where p is equal to three and five, satisfying certain conditions. The conjugation degree on the set is obtained by dividing the number of orbits with the size of the set. Hence, the results are obtained by finding the elements of the group that follow the conditions of the ordered set, followed by the computation of the number of orbits of the set. In the second part of this research, the obtained results of the conjugation degree on a set are then associated with graph theory. The corresponding orbit graph, generalized conjugacy class graph, generalized commuting graph and generalized non-commuting graph are determined where a union of complete and null graphs, one complete and null graphs, one complete and null graphs with one empty and null graphs are found. Accordingly, several properties of these graphs are obtained, which include the degree of the vertices, the clique number, the chromatic number, the independence number, the girth, as well as the diameter of the graph. Furthermore, some new graphs are introduced, namely the orderly set graph, the order class graph, the generalized co-prime order graph, and the generalized non co-prime order graph, which resulted in the finding of one complete or empty graphs, a union of two complete or one complete graphs, a union of complete and empty graphs and a complete or empty graphs. Finally, several algebraic properties of these graphs are determined. |
|---|