Solvable groups whose prime divisor character degree graphs are 1-connected (Q2329136)

The prime divisor character degree graph \(\Delta(G)\) of a finite group \(G\) is defined as follows: The vertices of \(\Delta(G)\) are the primes that divide \(\chi(1)\) for some \(\chi\in \operatorname{Irr}(G)\), and two distinct vertices \(p\) and \(q\) are connected by an edge when \(pq\) divides \(\chi(1)\) for some \(\chi\in \operatorname{Irr}(G)\). This graph has been studied in various papers in the situation where \(G\) is solvable. (For an overview up to 2008, see [\textit{M. Lewis}, Rocky Mt. J. Math. 39, No. 1, 175--211 (2008; Zbl 1166.20006)].) In the paper under review, cut vertices of \(\Delta(G)\) for \(G\) solvable are studied. A vertex of a graph is a cut vertex when removing it increases the number of connected components. The authors show that \(\Delta(G)\) can have at most one cut vertex. When \(\Delta(G)\) has a cut vertex, then \(G\) can have at most two normal nonabelian Sylow subgroups. The structure of such groups with exactly two normal nonabelian Sylow subgroups is investigated further.