English

Digraphs with degree two and excess two are diregular

Combinatorics 2019-02-04 v3

Abstract

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

Keywords

Cite

@article{arxiv.1703.08739,
  title  = {Digraphs with degree two and excess two are diregular},
  author = {James Tuite},
  journal= {arXiv preprint arXiv:1703.08739},
  year   = {2019}
}

Comments

Revised version

R2 v1 2026-06-22T18:56:54.663Z