Classifying Character Degree Graphs With 6 Vertices

2017/09/26 by Mark W. Bissler, Bissler, Mark W., Laubacher, Jacob +1
Computer Science · Engineering · Mathematics · #05C25 #20C15 #20D10 #Advanced Graph Theory Research #FOS: Mathematics #Finite Group Theory Research #Group Theory (math.GR) #Representation Theory (math.RT) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1709.09278

openalex publication_date 2017/09/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We investigate prime character degree graphs of solvable groups that have six vertices. There are one hundred twelve non-isomorphic connected graphs with six vertices, of which all except nine are classified in this paper. We also completely classify the disconnected graphs with six vertices.

Citations

• Classifying Families of Character Degree Graphs of Solvable Groups

Related

• Classifying character degree graphs with seven vertices
• Classifying Families of Character Degree Graphs of Solvable Groups
• A family of graphs that cannot occur as character degree graphs of solvable groups
• On prime character degree graphs occurring within a family of graphs (ii)
• On prime character degree graphs occurring within a family of graphs