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.
Groups whose degree graph has three independent vertices / S. Dolfi, K. Khedri, E. Pacifici. - In: JOURNAL OF ALGEBRA. - ISSN 0021-8693. - 512(2018 Oct 15), pp. 66-80. [10.1016/j.jalgebra.2018.07.004]
Groups whose degree graph has three independent vertices
E. PacificiUltimo
2018
Abstract
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.File | Dimensione | Formato | |
---|---|---|---|
2018EmptyTriangle.pdf
Open Access dal 09/07/2019
Tipologia:
Post-print, accepted manuscript ecc. (versione accettata dall'editore)
Dimensione
300.92 kB
Formato
Adobe PDF
|
300.92 kB | Adobe PDF | Visualizza/Apri |
1-s2.0-S0021869318304083-main.pdf
accesso riservato
Tipologia:
Publisher's version/PDF
Dimensione
400.5 kB
Formato
Adobe PDF
|
400.5 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.