Commuting conjugacy class graphs of finite groups

Suppose that G is a finite non-abelian group. Define the graph \Gamma(G) with the non-central conjugacy classes of G as vertex set and two distinct vertices A and B are adjacent if and only if there are x \in A and y \in B such that xy = yx. The graph \Gamma(G) is called the commuting conjugacy class graph of G and introduced by Mohammadian et al. in  [A. Mohammadian, A. Erfanian, M. Farrokhi D. G. and B. Wilkens,  Triangle-free commuting conjugacy class graphs, {J. Group Theory} {۱۹} (۳) (۲۰۱۶) ۱۰۴۹--۱۰۶۱]. In this paper, the graph structure of the commuting conjugacy class graph of nilpotent groups of order n are obtained in which n is not divisible by p^۵, for every prime factor p of n.

کلیدواژه ها:

Commuting conjugacy class graph ، nilpotent group ، p-group