Papers
Topics
Authors
Recent
Search
2000 character limit reached

Digraphs with degree two and excess two are diregular

Published 25 Mar 2017 in math.CO | (1703.08739v3)

Abstract: A $k$-geodetic digraph with minimum out-degree $d$ has excess $\epsilon $ if it has order $M(d,k) + \epsilon $, where $M(d,k)$ represents the Moore bound for out-degree $d$ and diameter $k$. For given $\epsilon $, it is simple to show that any such digraph must be out-regular with degree $d$ for sufficiently large $d$ and $k$. However, proving in-regularity is in general non-trivial. It has recently been shown that any digraph with excess $\epsilon = 1$ must be diregular. In this paper we prove that digraphs with minimum out-degree $d = 2$ and excess $\epsilon = 2$ are diregular for $k \geq 2$.

Authors (1)

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.