Let p be prime and , : x 7! xgx, the Discrete Lambert Map. For k ,1, let V = {0, 1, 2, . . ., pk −,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 2 V. We denote this digraph by G(g, pk), where g 2 (Z/pkZ), . In this piece of work, we investigate the structural properties and find new results modulo higher powers of primes. We show that if g is of order pd, 1 ,d ,k −,1 then G(g, pk) has pk−, d d 2 e loops. If g = tp + 1, 1 ,t ,pk−, 1 −,1 then the digraph contains p k +1 2 cycles. Further, if g has order pk−, 1 then G(g, pk) has p −,1 cycles of length pk−, 1 and the digraph is cyclic. We also propose explicit formulas for the enumeration of components.