  In this article, we study the structure of the graph implied by a given map
on the set $S_p=\{1,2,\dots,p-1\}$, where $p$ is an odd prime. The consecutive
applications of the map generate an integer sequence, or in graph theoretical
context a walk, that is linked to the discrete logarithm problem.
