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

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

2009-03-04

arxiv.org/abs/0903.0692v1

Mathematics

Group Theory

to appear in Algebra Colloquium

Scientific paper

Let $G$ be a non-abelian group. The non-commuting graph $\mathcal{A}_G$ 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 $\Gamma$ the maximum size of a complete subgraph of $\Gamma$ is called the clique number of $\Gamma$ and it is denoted by $\omega(\Gamma)$. In this paper we characterize all non-solvable groups $G$ with $\omega(\mathcal{A}_G)\leq 57$, where the number 57 is the clique number of the non-commuting graph of the projective special linear group $\mathrm{PSL}(2,7)$. We also complete the determination of $\omega(\mathcal{A}_G)$ for all finite minimal simple groups.

Affiliated with

Also associated with

No associations

Rating

On the clique number of non-commuting graphs of certain groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the clique number of non-commuting graphs of certain groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the clique number of non-commuting graphs of certain groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-368760