English

On the nonexistence of almost Moore digraphs with self-repeats

Combinatorics 2024-10-29 v1

Abstract

An almost Moore digraph is a diregular digraph of degree d>1d>1, diameter k>1k>1 and order d+d2++dkd+d^2+ \cdots +d^k. Their existence has only been shown for k=2k=2. It has also been conjectured that there are no more almost Moore digraphs, but so far their nonexistence has only been proven for k=3,4k=3,4 and for d=2,3d=2,3 when k3k\geq 3. In this paper we study the structure of the subdigraphs of an almost Moore digraph induced by the vertices fixed by an automorphism determined by a power of the permutation rr of repeats of the digraph. We deduce that each almost Moore digraph of degree dd and diameter kk with self-repeats has such a subdigraph whose vertices have order d1\leq d-1 under rr. From this, we extend the results about the nonexistence of almost Moore digraphs with self-repeats of degrees 4 and 5 to those whose diameter is large enough with respect to the degree. More precisely, we prove their nonexistence when k2(d1)k\geq 2(d-1) if kk is odd and when k2(d1)2k \geq 2(d-1)^2 if kk is even. We also show that these findings jointly with other results imply that there are no almost Moore digraphs with self-repeats for degrees dd, 6d126\leq d\leq 12, and k>2k>2.

Keywords

Cite

@article{arxiv.2410.20226,
  title  = {On the nonexistence of almost Moore digraphs with self-repeats},
  author = {Arnau Messegué and Josep Maria Miret},
  journal= {arXiv preprint arXiv:2410.20226},
  year   = {2024}
}