summary:We assign to each pair of positive integers $n$ and $k\geq 2$ a digraph $G(n,k)$ whose set of vertices is $H=\{0,1,\dots,n-1\}$ and for which there is a directed edge from $a\in H$ to $b\in H$ if $a^k\equiv b\pmod n$. 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\geq 2$ is arbitrary
AbstractLet D be a finite digraph, V(D) and A(D) will denote the sets of vertices and arcs of D resp...
AbstractA semicomplete multipartite digraph is obtained by replacing each edge of a complete multipa...
The Moore bound for a diregular digraph of degree d and diameter k is M d;k = 1 + d + : : : + d k ...
summary:We assign to each pair of positive integers $n$ and $k\geq 2$ a digraph $G(n,k)$ whose set o...
summary:We assign to each pair of positive integers $n$ and $k\ge 2$ a digraph $G(n,k)$ whose set o...
summary:We assign to each positive integer $n$ a digraph whose set of vertices is $H=\lbrace 0,1,\do...
summary:A power digraph, denoted by $G(n,k)$, is a directed graph with $\mathbb Z_{n}=\{0,1,\dots ,...
AbstractWe assign to each pair of positive integers n and k≥2 a digraph G(n,k) whose set of vertices...
summary:The paper extends the results given by M. Křížek and L. Somer, {\it On a connection of numbe...
summary:For any two positive integers $n$ and $k \geq 2$, let $G(n,k)$ be a digraph whose set of ver...
A $k$-partite $r$-digraph(multipartite multidigraph) (or briefly MMD)($k\geq 3$, $r\geq 1$) is the r...
summary:We introduce a weakened form of regularity, the so called semiregularity, and we show that i...
summary:Let $p$ be a prime. We assign to each positive number $k$ a digraph $G_{p}^{k}$ whose set of...
AbstractWe assign to each positive integer n a digraph G(n) whose set of vertices is H={0,1,…,n-1} a...
summary:A power digraph modulo $n$, denoted by $G(n,k)$, is a directed graph with $Z_{n}=\{0,1,\dots...
AbstractLet D be a finite digraph, V(D) and A(D) will denote the sets of vertices and arcs of D resp...
AbstractA semicomplete multipartite digraph is obtained by replacing each edge of a complete multipa...
The Moore bound for a diregular digraph of degree d and diameter k is M d;k = 1 + d + : : : + d k ...
summary:We assign to each pair of positive integers $n$ and $k\geq 2$ a digraph $G(n,k)$ whose set o...
summary:We assign to each pair of positive integers $n$ and $k\ge 2$ a digraph $G(n,k)$ whose set o...
summary:We assign to each positive integer $n$ a digraph whose set of vertices is $H=\lbrace 0,1,\do...
summary:A power digraph, denoted by $G(n,k)$, is a directed graph with $\mathbb Z_{n}=\{0,1,\dots ,...
AbstractWe assign to each pair of positive integers n and k≥2 a digraph G(n,k) whose set of vertices...
summary:The paper extends the results given by M. Křížek and L. Somer, {\it On a connection of numbe...
summary:For any two positive integers $n$ and $k \geq 2$, let $G(n,k)$ be a digraph whose set of ver...
A $k$-partite $r$-digraph(multipartite multidigraph) (or briefly MMD)($k\geq 3$, $r\geq 1$) is the r...
summary:We introduce a weakened form of regularity, the so called semiregularity, and we show that i...
summary:Let $p$ be a prime. We assign to each positive number $k$ a digraph $G_{p}^{k}$ whose set of...
AbstractWe assign to each positive integer n a digraph G(n) whose set of vertices is H={0,1,…,n-1} a...
summary:A power digraph modulo $n$, denoted by $G(n,k)$, is a directed graph with $Z_{n}=\{0,1,\dots...
AbstractLet D be a finite digraph, V(D) and A(D) will denote the sets of vertices and arcs of D resp...
AbstractA semicomplete multipartite digraph is obtained by replacing each edge of a complete multipa...
The Moore bound for a diregular digraph of degree d and diameter k is M d;k = 1 + d + : : : + d k ...