Digraphs with degree two and excess two are diregular
Combinatorics
2019-02-04 v3
Abstract
A -geodetic digraph with minimum out-degree has excess if it has order , where represents the Moore bound for out-degree and diameter . For given , it is simple to show that any such digraph must be out-regular with degree for sufficiently large and . However, proving in-regularity is in general non-trivial. It has recently been shown that any digraph with excess must be diregular. In this paper we prove that digraphs with minimum out-degree and excess are diregular for .
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