Classifying families of character degree graphs of solvable groups

We investigate prime character degree graphs of solvable groups. In particular, we consider a family of graphs Γk,t constructed by adjoining edges between two complete graphs in a one-to-one fashion. In this paper we determine completely which graphs Γk,t occur as the prime character degree graph of a solvable group.