Groups whose degree graph has three independent vertices

JOURNAL OF ALGEBRA

卷:512

Article

Dolfi, Silvio¹  Khedri, Khatoon²  Pacifici, Emanuele³ 

[1] Univ Firenze, Dipartimento Matemat & Informat U Dini, Viale Morgagni 67-A, I-50134 Florence, Italy

[2] Isfahan Univ Technol, Dept Math Sci, Esfahan 8415683111, Iran

[3] Univ Milan, Dipartimento Matemat F Enriques, Via Saldini 50, I-20133 Milan, Italy

关键词: Finite groups;    Character theory;    Graphs;   

DOI  :  10.1016/j.jalgebra.2018.07.004

来源: Elsevier

【 摘 要 】

Let G be a finite group, and let cd(G) denote the set of degrees of the irreducible complex characters of G. This paper is a contribution to the study of the degree graph of G, that is, the prime graph built on the set cd(G). Namely, we characterize finite groups whose degree graph has three independent vertices (i.e., three vertices that are pairwise non-adjacent). Our result turns out to be a generalization of several previously-known theorems concerning the structure of the degree graph. (C) 2018 Elsevier Inc. All rights reserved.

【 授权许可】

Free