In this paper, we identify LOW and OLW graphs, find the minimum \(\lambda\) for decomposition of \(\lambda k_n\), into these graphs, and show that for all viable values of \(\lambda\), the necessary conditions are sufficient for LOW- and OLW-decompositions using cyclic decompositions from base graphs.