Character degree graphs and normal subgroups

We consider the degrees of those irreducible characters of a group whose kernels do not contain a given normal subgroup . We show that if and is not perfect, then the common-divisor graph on this set of integers has at most two connected components. Also, if is solvable, we obtain bounds on the diameters of the components of this graph and, in the disconnected case, we study the structure of and of .