In this paper, we revisit LE 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 LE-decompositions using cyclic decompositions from base graphs.