Papers by Dini Aulia putri
An automorphism of finite graph G is a permutation on its vertex set that conserves adjacency. Th... more 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.
Uploads
Papers by Dini Aulia putri