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 / Silvio Dolfi, Khatoon Khedri, Emanuele Pacifici. - In: JOURNAL OF ALGEBRA. - ISSN 1090-266X. - STAMPA. - 512:(2018), pp. 66-80. [10.1016/j.jalgebra.2018.07.004]
Groups whose degree graph has three independent vertices
Silvio Dolfi
;Emanuele Pacifici
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 | |
---|---|---|---|
GroupsWhoseDegreeGraphHasThreeIndependentVertices.pdf
Accesso chiuso
Descrizione: Articolo principale
Tipologia:
Pdf editoriale (Version of record)
Licenza:
Tutti i diritti riservati
Dimensione
400.5 kB
Formato
Adobe PDF
|
400.5 kB | Adobe PDF | Richiedi una copia |
EmptyTriangle.pdf
accesso aperto
Tipologia:
Versione finale referata (Postprint, Accepted manuscript)
Licenza:
Open Access
Dimensione
300.48 kB
Formato
Adobe PDF
|
300.48 kB | Adobe PDF |
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.