Classifying families of character degree graphs of solvable groups
نویسندگان
1 Western Governors University
2 St. Norbert College
doi
10.22108/ijgt.2018.110140.1473چکیده
We investigate prime character degree graphs of solvable groups. In particular, we consider a family of graphs $\Gamma_{k,t}$ constructed by adjoining edges between two complete graphs in a one-to-one fashion. In this paper we determine completely which graphs $\Gamma_{k,t}$ occur as the prime character degree graph of a solvable group.