Let H be a group and Y be a non-empty subset of H. The commuting graph Γ= C (H, Y) has Y
as the node set, where y 1, y 2∈ Y are adjacent whenever y 1 and y 2 commute in H. In this …

The power graph of a group Ω is a graph, whose node set is Ω and two distinct elements are
adjacent if and only if one is an integral power of the other. A metric dimension of a graph Γ …

Abstract Let G= Zp2× Zp3 be a finite group of order p5. Suppose that d is a divisor of the
order of group G. In this article, we enumerated all automorphisms of G fixing d elements of …

Let G= Z p⊕ Z p 2, where p is a prime number. Suppose that d is a divisor of the order of G.
In this paper, we find the number of automorphisms of G fixing d elements of G and denote it …