Classifying character degree graphs with six vertices

DOI10.1007/s13366-019-00437-yzbMath1475.20013arXiv1709.09278OpenAlexW2963095506MaRDI QIDQ2316763

Jacob Laubacher, Mark L. Lewis, Mark W. Bissler

Publication date: 6 August 2019

Published in: Beiträge zur Algebra und Geometrie (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1709.09278

zbMATH Keywords

solvable groupcharacter degree graph

Mathematics Subject Classification ID

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

Related Items (4)

On prime character degree graphs occurring within a family of graphs (ii) ⋮ Five-vertex degree graphs of nonsolvable groups ⋮ An overview on the bipartite divisor graph for the set of irreducible character degrees ⋮ On prime character degree graphs occurring within a family of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Character degree graphs of solvable groups with diameter three
• Regular character degree graphs.
• A table of connected graphs on six vertices
• An overview of graphs associated with character degrees and conjugacy class sizes in finite groups.
• On the character degree graph of solvable groups. I: Three primes
• Solvable groups whose degree graphs have two connected components
• A solvable group whose character degree graph has diameter $3$
• On the character degree graph of solvable groups
• SOLVABLE GROUPS WITH CHARACTER DEGREE GRAPHS HAVING 5 VERTICES AND DIAMETER 3
• On the character degree graph of solvable groups. II. Discon- nected graphs
• Classifying families of character degree graphs of solvable groups
• Endliche Gruppen I
• On the absence of a normal nonabelian Sylow subgroup

This page was built for publication: Classifying character degree graphs with six vertices