Let G be a finite solvable group. Assume that the degree graph of G ha
s exactly two connected components that do not contain 1. Suppose that
one of these connected components contains the subset {a(1), ..., a(n
}), where a(i) and a(j) are coprime when i not equal i. Then the deriv
ed length of G is less than or equal to \cd(G)\ - n + 1.