A survey on multi-loop networks
Theoretical Computer Science
A symbolical algorithm on additive basis and double-loop networks
Theoretical Computer Science - Combinatorics of the discrete plane and tilings
Circulant digraphs and monomial ideals
CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
| Hi-index | 0.00 |
Let $G(N, A)$ be the Cayley digraph associated with ${\bf Z}/(N)$ and $A$, where $N$ is a positive integer and $A$ is a subset of $\{1, 2, ..., N - 1\}$. Let $N(d, k)$ be the maximum $N$ such that the diameter of $G(N, A)$ is less than or equal to $d$ for some $A = \{a_{1}, a_{2},\ldots, a_{k}\}$ with $1 = a_{1},