首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Character degree graphs that are complete graphs
Authors:Mariagrazia Bianchi  David Chillag  Mark L Lewis  Emanuele Pacifici
Institution:Dipartimento di Matematica ``F. Enriques', Università Degli Studi Di Milano, Via C. Saldini 50, 20133 Milano, Italy ; Department of Mathematics, Technion, Israel Institute of Technology, Haifa 32000, Israel ; Department of Mathematical Sciences, Kent State University, Kent, Ohio 44242 ; Dipartimento di Matematica ``F. Enriques', Università Degli Studi Di Milano, Via C. Saldini 50, 20133 Milano, Italy
Abstract:Let $ G$ be a finite group, and write $ \operatorname{cd}(G)$ for the set of degrees of irreducible characters of $ G$. We define $ \Gamma(G)$ to be the graph whose vertex set is $ \operatorname{cd}(G)-\{1\}$, and there is an edge between $ a$ and $ b$ if $ (a,b)>1$. We prove that if $ \Gamma(G)$ is a complete graph, then $ G$ is a solvable group.

Keywords:
点击此处可从《Proceedings of the American Mathematical Society》浏览原始摘要信息
点击此处可从《Proceedings of the American Mathematical Society》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号