A numbering f of a graph G of order n is a labeling that assigns distinct elements of the set {1, 2, . . . , n} to the vertices of G. The strength of G is defined by In this paper, some results obtained from factorizations of complete graphs are presented. In particular, it is shown that for every k ∈ [1, n − 1], there exists a graph G of order n satisfying δ (G) = k and str (G) = n + k, where δ (G) denotes the minimum degree of G.