Abstract | ||
---|---|---|
An almost Moore (d, k)-digraph is a regular digraph of degree d > 1, diameter k > 1 and order N(d, k) = d + d(2) + ... + d(k). So far, their existence has only been showed for k = 2. Their nonexistence has been proved for k = 3, 4 and for d = 2, 3 when k >= 3. In this paper, we prove that (4, k) and (5, k)-digraphs with self-repeats do not exist for infinitely many primes k. |
Year | DOI | Venue |
---|---|---|
2015 | 10.1007/s11786-015-0219-z | Mathematics in Computer Science |
Keywords | Field | DocType |
Almost Moore digraphs, Irreducibility of the polynomials | Discrete mathematics,Combinatorics,Mathematics,Digraph | Journal |
Volume | Issue | ISSN |
9 | 2 | 1661-8270 |
Citations | PageRank | References |
0 | 0.34 | 9 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
J. Conde | 1 | 17 | 2.77 |
Mirka Miller | 2 | 530 | 90.29 |
Josep M. Miret | 3 | 81 | 14.88 |
Kumar Saurav | 4 | 0 | 0.68 |