paper

On the clique number of non-commuting graphs of certain groups

arXiv:0903.0692

Abstract

Let be a non-abelian group. The non-commuting graph of is defined as the graph whose vertex set is the non-central elements of 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 with , where the number 57 is the clique number of the non-commuting graph of the projective special linear group . We also complete the determination of for all finite minimal simple groups.

to appear in Algebra Colloquium

On the clique number of non-commuting graphs of certain groups · wovepaper