Miller, Mirka; Gimbert, Joan; Širáň, Jozef and Slamin, S.
|DOI (Digital Object Identifier) Link:||http://doi.org/10.1016/S0012-365X(99)00357-X|
|Google Scholar:||Look up in Google Scholar|
An almost Moore digraph is a digraph of diameter k≥2, maximum out-degree d≥2 and order n=d+d2+...+dk, 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.
|Item Type:||Journal Article|
|Copyright Holders:||2000 Elsevier Science B.V.|
|Academic Unit/Department:||Mathematics, Computing and Technology > Mathematics and Statistics
Mathematics, Computing and Technology
|Depositing User:||Jozef Širáň|
|Date Deposited:||24 Sep 2010 15:26|
|Last Modified:||14 Jan 2016 16:33|
|Share this page:|