In this paper, we study the connection of number theory with graph theory via investigating some uncharted properties of the directed graph \(\Gamma'(n)\) whose vertex set is \(\mathbb{Z}_n = \{0,1,\ldots,n-1\}\), and for which there is a directed edge from \(a \in \mathbb{Z}_n\) to \(b \in \mathbb{Z}_n\) if and only if \(a^3 \equiv b \pmod{n}\). For an arbitrary prime \(p\), the formula for the decomposition of the graph \(\Gamma(p)\) is established. We specify two subgraphs \(\Gamma_1(n)\) and \(\Gamma_2(n)\) of \(\Gamma(n)\). Let \(\Gamma_1(n)\) be induced by the vertices which are coprime to \(n\) and \(\Gamma_2(n)\) by induced by the set of vertices which are not coprime to \(n\). We determine the level of every component of \(\Gamma_1(n)\), and establish necessary and sufficient conditions when \(\Gamma_1(n)\) or \(\Gamma_2(n)\) has no cycles with length greater than \(1\), respectively. Moreover, the conditions for the semiregularity of \(\Gamma_2(n)\) are presented.
1970-2025 CP (Manitoba, Canada) unless otherwise stated.