On the clique number of non-commuting graphs of certain groups
On the clique number of non-commuting graphs of certain groups
复制标题
关于某些群体的非通勤图的派系数
DOI:
--
复制
发表时间:
2009
期刊:
影响因子:
--
通讯作者:
M. Zarrin
中科院分区:
文献类型:
--
作者:
Alireza Abdollahi;A. Azad;A. M. Hassanabadi;M. Zarrin
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.