Advanced Search

A power digraph, denoted by $G(n,k)$, is a directed graph with ${\mathbb{Z}}_n=\{0,1,\cdots ,n-1\}$ as the set of vertices and $E=\{(a,b):a^k\equiv b(modn)\}$ as the edge set. In this paper we extend the work done by Lawrence Somer and Michal Křížek: On a connection of number theory with graph theory, Czech. Math. J. 54 (2004), 465–485, and Lawrence Somer and Michal Křížek: Structure of digraphs associated with quadratic congruences with composite moduli, Discrete Math. 306 (2006), 2174–2185. The heights of the vertices and the components of $G(n,k)$ for $n\ge 1$ and $k\ge 2$ are determined....

A power digraph modulo $n$, denoted by $G(n,k)$, is a directed graph with $Z_n=\{0,1,\cdots ,n-1\}$ as the set of vertices and $E=\{(a,b):a^k\equiv b(modn)\}$ as the edge set, where $n$ and $k$ are any positive integers. In this paper we find necessary and sufficient conditions on $n$ and $k$ such that the digraph $G(n,k)$ has at least one isolated fixed point. We also establish necessary and sufficient conditions on $n$ and $k$ such that the digraph $G(n,k)$ contains exactly two components. The primality of Fermat number is also discussed.