Classifying character degree graphs with six vertices (Q2316763)

Let \(\mathrm{cd}(G)\) denote the set of all character degrees of the finite group \(G\) and \(\mathrm{p}(G)\) be the set of prime divisors of elements in \(\mathrm{cd}(G)\).The prime character degree graph of \(G\) is a graph with vertex set \(\mathrm{p}(G)\) in which two vertices \(p\) and \(q\) are joined by an edge if \(pq\) divides an element in \(\mathrm{cd}(G)\). In the paper under review, the authors investigate the graphs with 6 vertices and try to answer this question whether which graph can be the prime character degree graph of a solvable group. After applying the known results, the authors are able to conclude that 13 of the connected graphs with 6 vertices occure as the prime character degree graph for some solvable group.