Let G be a finite group, and let Δ(G) denote the prime graph built on the set of degrees of the irreducible complex characters of G. It is well known that, whenever Δ(G) is connected, the diameter of Δ(G) is at most 3. In the present paper, we provide a description of the finite solvable groups for which the diameter of this graph attains the upper bound. This also enables us to confirm a couple of conjectures proposed by M. L. Lewis.
Groups whose character degree graph has diameter three / Casolo, Carlo; Dolfi, Silvio; Pacifici, Emanuele; Sanus, Lucia. - In: ISRAEL JOURNAL OF MATHEMATICS. - ISSN 0021-2172. - STAMPA. - 215:(2016), pp. 523-558. [10.1007/s11856-016-1387-5]
Groups whose character degree graph has diameter three
CASOLO, CARLO;DOLFI, SILVIO;PACIFICI, EMANUELE;
2016
Abstract
Let G be a finite group, and let Δ(G) denote the prime graph built on the set of degrees of the irreducible complex characters of G. It is well known that, whenever Δ(G) is connected, the diameter of Δ(G) is at most 3. In the present paper, we provide a description of the finite solvable groups for which the diameter of this graph attains the upper bound. This also enables us to confirm a couple of conjectures proposed by M. L. Lewis.File | Dimensione | Formato | |
---|---|---|---|
DiameterThreeCharacterGraph.pdf
Accesso chiuso
Descrizione: Articolo principale
Tipologia:
Pdf editoriale (Version of record)
Licenza:
Tutti i diritti riservati
Dimensione
408.65 kB
Formato
Adobe PDF
|
408.65 kB | Adobe PDF | Richiedi una copia |
CharacterDegreeGraphDiameterThree.pdf
accesso aperto
Tipologia:
Versione finale referata (Postprint, Accepted manuscript)
Licenza:
Tutti i diritti riservati
Dimensione
342.95 kB
Formato
Adobe PDF
|
342.95 kB | Adobe PDF |
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.