summary:Let $p$ be a prime. We assign to each positive number $k$ a digraph $G_{p}^{k}$ whose set of vertices is $\{1,2,\ldots ,p-1\}$ and there exists a directed edge from a vertex $a$ to a vertex $b$ if $a^k\equiv b \pmod {p}$. In this paper we obtain a necessary and sufficient condition for $G_{p}^{k_{1}}\simeq G_{p}^{k_{2}}$
AbstractWe assign to each pair of positive integers n and k≥2 a digraph G(n,k) whose set of vertices...
AbstractGiven a digraph G and a sufficiently long directed path P, a folklore result says that G is ...
AbstractWe assign to each positive integer n a digraph G(n) whose set of vertices is H={0,1,…,n-1} a...
For positive integers n and k, let G(n,k) denote the digraph whose set of vertices is {0,1,2,…,n-1} ...
summary:Let $p$ be a prime. We assign to each positive number $k$ a digraph $G_{p}^{k}$ whose set of...
summary:For any two positive integers $n$ and $k \geq 2$, let $G(n,k)$ be a digraph whose set of ver...
We define G(n, k) to be a directed graph whose set of vertices is {0, 1,..., n − 1} and whose set of...
For each pair of positive integers n and k, let G(n,k) denote the digraph whose set of vertices is H...
summary:A power digraph, denoted by $G(n,k)$, is a directed graph with $\mathbb Z_{n}=\{0,1,\dots ,...
AbstractFor any positive integers n and k, let G(n,k) denote the digraph whose set of vertices is H=...
summary:We assign to each pair of positive integers $n$ and $k\ge 2$ a digraph $G(n,k)$ whose set o...
We define G(n, k) to be a directed graph whose set of vertices is {0, 1, ..., n−1} and whose set of ...
summary:A power digraph modulo $n$, denoted by $G(n,k)$, is a directed graph with $Z_{n}=\{0,1,\dots...
summary:We assign to each positive integer $n$ a digraph whose set of vertices is $H=\lbrace 0,1,\do...
summary:We assign to each pair of positive integers $n$ and $k\geq 2$ a digraph $G(n,k)$ whose set o...
AbstractWe assign to each pair of positive integers n and k≥2 a digraph G(n,k) whose set of vertices...
AbstractGiven a digraph G and a sufficiently long directed path P, a folklore result says that G is ...
AbstractWe assign to each positive integer n a digraph G(n) whose set of vertices is H={0,1,…,n-1} a...
For positive integers n and k, let G(n,k) denote the digraph whose set of vertices is {0,1,2,…,n-1} ...
summary:Let $p$ be a prime. We assign to each positive number $k$ a digraph $G_{p}^{k}$ whose set of...
summary:For any two positive integers $n$ and $k \geq 2$, let $G(n,k)$ be a digraph whose set of ver...
We define G(n, k) to be a directed graph whose set of vertices is {0, 1,..., n − 1} and whose set of...
For each pair of positive integers n and k, let G(n,k) denote the digraph whose set of vertices is H...
summary:A power digraph, denoted by $G(n,k)$, is a directed graph with $\mathbb Z_{n}=\{0,1,\dots ,...
AbstractFor any positive integers n and k, let G(n,k) denote the digraph whose set of vertices is H=...
summary:We assign to each pair of positive integers $n$ and $k\ge 2$ a digraph $G(n,k)$ whose set o...
We define G(n, k) to be a directed graph whose set of vertices is {0, 1, ..., n−1} and whose set of ...
summary:A power digraph modulo $n$, denoted by $G(n,k)$, is a directed graph with $Z_{n}=\{0,1,\dots...
summary:We assign to each positive integer $n$ a digraph whose set of vertices is $H=\lbrace 0,1,\do...
summary:We assign to each pair of positive integers $n$ and $k\geq 2$ a digraph $G(n,k)$ whose set o...
AbstractWe assign to each pair of positive integers n and k≥2 a digraph G(n,k) whose set of vertices...
AbstractGiven a digraph G and a sufficiently long directed path P, a folklore result says that G is ...
AbstractWe assign to each positive integer n a digraph G(n) whose set of vertices is H={0,1,…,n-1} a...
DOI
Add to ORKG