On the nonexistence of almost Moore digraphs with self-repeats

Abstract

An almost Moore digraph is a diregular digraph of degree d>1, diameter k>1 and order d+d2+ ·s +dk. Their existence has only been shown for k=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,4 and for d=2,3 when k≥ 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 r of repeats of the digraph. We deduce that each almost Moore digraph of degree d and diameter k with self-repeats has such a subdigraph whose vertices have order ≤ d-1 under r. 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 k≥ 2(d-1) if k is odd and when k ≥ 2(d-1)2 if k 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 d, 6≤ d≤ 12, and k>2.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…