Character degree graphs that are complete graphs
Character degree graphs that are complete graphs
复制标题
DOI：
10.1090/s0002-9939-06-08651-5
复制
发表时间：
2006-08
期刊：
影响因子：
--
通讯作者：
M. Bianchi;D. Chillag;M. Lewis;E. Pacifici
中科院分区：
文献类型：
--
作者：
M. Bianchi;D. Chillag;M. Lewis;E. Pacifici
设G是一个有限群，记cd（G）为G的不可约特征标的次数集.我们定义F（G）为顶点集为cd（G）- {1}的图，如果（a，B）> 1，则在a和B之间存在一条边.证明了若Γ（G）是完全图，则G是可解群.
Let G be a finite group, and write cd(G) for the set of degrees of irreducible characters of G. We define F(G) to be the graph whose vertex set is cd(G) - {1}, and there is an edge between a and b if (a, b) > 1. We prove that if Γ(G) is a complete graph, then G is a solvable group.