Classifying Families of Character Degree Graphs of Solvable Groups
arXiv:1708.00119
Abstract
We investigate prime character degree graphs of solvable groups. In particular, we consider a family of graphs constructed by adjoining edges between two complete graphs in a one-to-one fashion. In this paper we determine completely which graphs occur as the prime character degree graph of a solvable group.
7 pages, 5 figures, updated version is reorganized