Let p be prime and α : x → xg x , the Discrete Lambert Map. For k ≥ 1, let V = {0, 1, 2, ..., p k − 1}. The iteration digraph is a directed graph with V as the vertex set and there is a unique directed edge from u to α(u) for each u ∈ V. We denote this digraph by G(g, p k ), where g ∈ (Z/p k Z) * . In this piece of work, we investigate the structural properties and find new results modulo higher powers of primes. We showFurther, if g has order p k−1 then G(g, p k ) has p − 1 cycles of length p k−1 and the digraph is cyclic. We also propose explicit formulas for the enumeration of components.