فهرست نشریات علمی دسترسی آزاد ایران

The nilpotent graph of a finite group $G$, denoted by $\Gamma_N(G)$, is a simple graph whose vertex set is $G - nil(G)$, where $nil(G)= \{g\in G: \langle g, h\rangle \ \text{is nilpotent for all} \ h\in G\}$, and two distinct vertices are related if they generate a nilpotent subgroup of $G$. In this work, lower bounds for the clique number and the number of connected components of $\Gamma_N(G)$ are presented in terms of the size of its Fitting subgroup and the number of its strongly self-centralizing subgroups of $G$, respectively. We prove that no finite non-nilpotent group has a self-complementary nilpotent graph. Furthermore, for the dihedral group $D_{n}$, it is determined that the number of connected components of its nilpotent graph is one more than $n$ when $n$ is odd or one more than the $2'$ part of $n$ when $n$ is even. In addition, a formula for the number of connected components of $\Gamma_N(psl(2,q))$, where $q$ is a prime power, is provided.