AbstractWe assign to each positive integer n a digraph G(n) whose set of vertices is H={0,1,…,n-1} and for which there exists a directed edge from a∈H to b∈H if a2≡b(modn). Associated with G(n) are two disjoint subdigraphs: G1(n) and G2(n) whose union is G(n). The vertices of G1(n) correspond to those residues which are relatively prime to n. The structure of G1(n) is well understood. In this paper, we investigate in detail the structure of G2(n)
We introduce and investigate a new class of graphs arrived from exponential congruences. For each pa...
AbstractThis paper gives a simple combinatorial proof of the multiplicativity of directed cycles of ...
Let Zn be the ring of residue classes modulo n. Define f : Zn 7→ Zn by f (x) = x4. Action of this ma...
summary:We assign to each positive integer $n$ a digraph whose set of vertices is $H=\lbrace 0,1,\do...
summary:The paper extends the results given by M. Křížek and L. Somer, {\it On a connection of numbe...
summary:We assign to each pair of positive integers $n$ and $k\ge 2$ a digraph $G(n,k)$ whose set o...
summary:A power digraph modulo $n$, denoted by $G(n,k)$, is a directed graph with $Z_{n}=\{0,1,\dots...
summary:Let $p$ be a prime. We assign to each positive number $k$ a digraph $G_{p}^{k}$ whose set of...
summary:A power digraph, denoted by $G(n,k)$, is a directed graph with $\mathbb Z_{n}=\{0,1,\dots ,...
We define G(n, k) to be a directed graph whose set of vertices is {0, 1, ..., n−1} and whose set of ...
AbstractWe consider the properties of certain graphs based on iteration of the quadratic maps x→x2 a...
summary:For any two positive integers $n$ and $k \geq 2$, let $G(n,k)$ be a digraph whose set of ver...
summary:We assign to each pair of positive integers $n$ and $k\geq 2$ a digraph $G(n,k)$ whose set o...
For positive integers n and k, let G(n,k) denote the digraph whose set of vertices is {0,1,2,…,n-1} ...
The digraphs of commutative rings under modular arithmetic reveal intriguing cycle patterns, many of...
We introduce and investigate a new class of graphs arrived from exponential congruences. For each pa...
AbstractThis paper gives a simple combinatorial proof of the multiplicativity of directed cycles of ...
Let Zn be the ring of residue classes modulo n. Define f : Zn 7→ Zn by f (x) = x4. Action of this ma...
summary:We assign to each positive integer $n$ a digraph whose set of vertices is $H=\lbrace 0,1,\do...
summary:The paper extends the results given by M. Křížek and L. Somer, {\it On a connection of numbe...
summary:We assign to each pair of positive integers $n$ and $k\ge 2$ a digraph $G(n,k)$ whose set o...
summary:A power digraph modulo $n$, denoted by $G(n,k)$, is a directed graph with $Z_{n}=\{0,1,\dots...
summary:Let $p$ be a prime. We assign to each positive number $k$ a digraph $G_{p}^{k}$ whose set of...
summary:A power digraph, denoted by $G(n,k)$, is a directed graph with $\mathbb Z_{n}=\{0,1,\dots ,...
We define G(n, k) to be a directed graph whose set of vertices is {0, 1, ..., n−1} and whose set of ...
AbstractWe consider the properties of certain graphs based on iteration of the quadratic maps x→x2 a...
summary:For any two positive integers $n$ and $k \geq 2$, let $G(n,k)$ be a digraph whose set of ver...
summary:We assign to each pair of positive integers $n$ and $k\geq 2$ a digraph $G(n,k)$ whose set o...
For positive integers n and k, let G(n,k) denote the digraph whose set of vertices is {0,1,2,…,n-1} ...
The digraphs of commutative rings under modular arithmetic reveal intriguing cycle patterns, many of...
We introduce and investigate a new class of graphs arrived from exponential congruences. For each pa...
AbstractThis paper gives a simple combinatorial proof of the multiplicativity of directed cycles of ...
Let Zn be the ring of residue classes modulo n. Define f : Zn 7→ Zn by f (x) = x4. Action of this ma...