In the first part, we assign to each positive integer $n$ a digraph $\Gamma (n,5),$ whose set of vertices consists of elements of the ring ${\mathbb{Z}}_n=\{0,1,\cdots ,n-1\}$ with the addition and the multiplication operations modulo $n,$ and for which there is a directed edge from $a$ to $b$ if and only if $a^5\equiv b(modn)$. Associated with $\Gamma (n,5)$ are two disjoint subdigraphs: ${\Gamma }_1(n,5)$ and ${\Gamma }_2(n,5)$ whose union is $\Gamma (n,5).$ The vertices of ${\Gamma }_1(n,5)$ are coprime to $n,$ and the vertices of ${\Gamma }_2(n,5)$ are not coprime to $n.$ In this part, we study the structure of $\Gamma (n,5)$ in detail. In the second part, we investigate...

We assign to each positive integer $n$ a digraph whose set of vertices is $H=\{0,1,\cdots ,n-1\}$ and for which there is a directed edge from $a\in H$ to $b\in H$ if $a^2\equiv b\left(modn\right)$. We establish necessary and sufficient conditions for the existence of isolated fixed points. We also examine when the digraph is semiregular. Moreover, we present simple conditions for the number of components and length of cycles. Two new necessary and sufficient conditions for the compositeness of Fermat numbers are also introduced.

The article studies the cubic mapping graph $\Gamma \left(n\right)$ of ${\mathbb{Z}}_n\left[\mathrm{i}\right]$, the ring of Gaussian integers modulo $n$. For each positive integer $n>1$, the number of fixed points and the in-degree of the elements $\overline{1}$ and $\overline{0}$ in $\Gamma \left(n\right)$ are found. Moreover, complete characterizations in terms of $n$ are given in which ${\Gamma }_2\left(n\right)$ is semiregular, where ${\Gamma }_2\left(n\right)$ is induced by all the zero-divisors of ${\mathbb{Z}}_n\left[\mathrm{i}\right]$.

We assign to each pair of positive integers $n$ and $k\ge 2$ a digraph $G(n,k)$ whose set of vertices is $H=\{0,1,\cdots ,n-1\}$ and for which there is a directed edge from $a\in H$ to $b\in H$ if $a^k\equiv b(modn)$. The digraph $G(n,k)$ is semiregular if there exists a positive integer $d$ such that each vertex of the digraph has indegree $d$ or 0. Generalizing earlier results of the authors for the case in which $k=2$, we characterize all semiregular digraphs $G(n,k)$ when $k\ge 2$ is arbitrary.