For a nilpotent group $G$, let $\Xi(G)$ be the difference between complement of generating graph $G$ and commuting with vertices corresponding to central elements removed. That is, has vertex set $G \setminus Z(G)$, two adjacent if only they do not commute generate $G$. Additionally, $\Xi^+(G)$ subgraph induced by its non-isolated vertices. We show that an edge, then is connected diameter $2$ o...

Let G be a non-abelian group and let Z(G) be the center of G. Associate a graph ΓG (called noncommuting graph of G) with G as follows: Take G\Z(G) as the vertices of ΓG and join two distinct vertices x and y, whenever xy = yx. We want to explore how the graph theoretical properties of ΓG can effect on the group theoretical properties of G. We conjecture that if G and H are two non-abelian finit...

Let G be a non-abelian group. The non-commuting graph AG of G is defined as the graph whose vertex set is the non-central elements of G and two vertices are joint if and only if they do not commute. In a finite simple graph Γ, the maximum size of complete subgraphs of Γ is called the clique number of Γ and denoted by ω(Γ). In this paper, we characterize all non-solvable groups G with ω(AG) ≤ 57...

Given a non-abelian finite group G, let π(G) denote the set of prime divisors of the order of G and denote by Z(G) the center of G. The prime graph of G is the graph with vertex set π(G) where two distinct primes p and q are joined by an edge if and only if G contains an element of order pq and the non-commuting graph of G is the graph with the vertex set G−Z(G) where two non-central elements x...

Let G be a non-abelian group. The non-commuting graph AG of G is defined as the graph whose vertex set is the non-central elements of G and two vertices are joint if and only if they do not commute. In a finite simple graph Γ the maximum size of a complete subgraph of Γ is called the clique number of Γ and it is denoted by ω(Γ). In this paper we characterize all non-solvable groups G with ω(AG)...

Let G be a abelian finite group. The non-commuting graph Δ(G) of G is defined as follows: The vertex set is G− Z(G), two vertex x and y are joined by an edge whenever xy = yx. Note that if G is abelian, then Δ(G) has no vertices. So, throughout this article let G be a nonabelian finite group. There are many papers on algebraic structure, using the properties of graphs, for instance see [4, 2, 3...