Almost Moore digraphs are diregular

Miller, Mirka; Gimbert, Joan; Širáň, Jozef and Slamin, S. (2000). Almost Moore digraphs are diregular. Discrete Mathematics, 218(1-3) pp. 265–270.

DOI: https://doi.org/10.1016/S0012-365X(99)00357-X

Abstract

An almost Moore digraph is a digraph of diameter k≥2, maximum out-degree d≥2 and order n=d+d²+...+d^k, that is, one less than the Moore bound. It is easy to show that the out-degree of an almost Moore digraph is constant (=d). In this note we prove that also the in-degree of an almost Moore digraph is constant (=d), that is, every almost Moore digraph is diregular of degree d.

Viewing alternatives

Metrics

Item Actions

Export

You can export this page using these formats Digital Object Identifier - DOI