Character degree graphs that are complete graphs

被引：129
|
作者：
Bianchi, Mariagrazia
Chillag, David
Lewis, Mark L.
Pacifici, Emanuele
机构：
[1] Univ Milan, Dipartimento Matemat F Enriques, I-20133 Milan, Italy
[2] Technion Israel Inst Technol, Dept Math, IL-32000 Haifa, Israel
[3] Kent State Univ, Dept Math Sci, Kent, OH 44242 USA
来源：
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY | 2007年 / 135卷 / 03期
关键词：
D O I：
10.1090/S0002-9939-06-08651-5
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Let G be a finite group, and write cd(G) for the set of degrees of irreducible characters of G. We de. ne G( 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(G) is a complete graph, then G is a solvable group.
引用
收藏
页码：671 / 676
页数：6
相关论文
共 50 条
12345