Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the nonexistence of almost Moore digraphs with self-repeats

Published 26 Oct 2024 in math.CO | (2410.20226v1)

Abstract: An almost Moore digraph is a diregular digraph of degree $d>1$, diameter $k>1$ and order $d+d2+ \cdots +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\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 $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 $\leq 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\geq 2(d-1)$ if $k$ is odd and when $k \geq 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\leq d\leq 12$, and $k>2$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.