Strongly connective degree sets. II: Perfect derived subgroups.

DOI10.1007/S00013-005-1679-1zbMATH Open1106.20004OpenAlexW2087888900MaRDI QIDQ2501152FDOQ2501152

Authors: John K. McVey 

Publication date: 4 September 2006

Published in: Archiv der Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00013-005-1679-1

Recommendations

• Strongly connective degree sets. I: Nonabelian solvable quotients.
• Character degree graphs and normal subgroups
• Disconnectedness and Diameters of Degree Graphs Associated with Normal Subgroups#
• Finite groups whose common-divisor graph is regular
• Permutation group subdegrees and the common divisor graph

zbMATH Keywords

connected componentsdiametersirreducible character degreescommon-divisor graphs

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Ordinary representations and characters (20C15) Representations of sporadic groups (20C34) Arithmetic and combinatorial problems involving abstract finite groups (20D60)

Cited In (4)

• Permutation group subdegrees and the common divisor graph
• An overview of graphs associated with character degrees and conjugacy class sizes in finite groups.
• Simple groups and strong covers.
• Strongly connective degree sets. I: Nonabelian solvable quotients.

This page was built for publication: Strongly connective degree sets. II: Perfect derived subgroups.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2501152)