A solvable group whose character degree graph has diameter $3$ (Q2759005): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A condition on lengths of conjugacy classes and character degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012093 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Character theory of finite groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4103728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coprime Group Actions Fixing All Nonlinear Irreducible Characters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irreducible character degrees and normal subgroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOLVABLE GROUPS WITH CHARACTER DEGREE GRAPHS HAVING 5 VERTICES AND DIAMETER 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3834224 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273959 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the character degree graph of solvable groups. I: Three primes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Character degrees, class sizes, and normal subgroups of a certain class of \(p\)-groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4428096 / rank
 
Normal rank

Latest revision as of 21:43, 3 June 2024

scientific article
Language Label Description Also known as
English
A solvable group whose character degree graph has diameter $3$
scientific article

    Statements

    A solvable group whose character degree graph has diameter $3$ (English)
    0 references
    0 references
    10 December 2001
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    finite solvable groups
    0 references
    character degree graphs
    0 references
    connected components
    0 references
    diameters
    0 references