Full automorphism group of commuting and non-commuting graph of dihedral and symmetric groups

Abdussakir, Abdussakir and Putri, Dini Chandra Aulia and Fadhillah, Ziyadatur Rohmah (2018) Full automorphism group of commuting and non-commuting graph of dihedral and symmetric groups. Journal of Physics: Conference Series, 1028 (012112). pp. 1-5. ISSN 1742-6588

[img]
Preview
Text (full text)
3669.pdf - Published Version
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (832kB) | Preview
Full text available at: http://iopscience.iop.org/article/10.1088/1742-659...

Abstract

An automorphism of finite graph G is a permutation on its vertex set that conserves adjacency. The set of all automorphism of G is a group under composition of function. This group is called the full automorphism group of G. Study on the full automorphism group is an interesting topic because most graphs have only the trivial automorphism and many special graphs have many automorphisms. One of the special graphs is graph that associated with group. The result of this paper is the full automorphism groups of commuting and non-commuting graph of non-abelian finite group, especially on dihedral and symmetric groups, according to the choice of their subgroups.

Item Type: Journal Article
Subjects: 01 MATHEMATICAL SCIENCES > 0101 Pure Mathematics > 010105 Group Theory and Generalisations
Divisions: Faculty of Mathematics and Sciences > Department of Mathematics
Depositing User: Abdussakir Abdussakir
Date Deposited: 02 Jul 2018 10:04

Downloads

Downloads per month over past year

Origin of downloads

Actions (login required)

View Item View Item