On The Existence of Non-Diregular Digraphs of Order Two Less than the Moore Bound

Abstract

A communication network can be modelled as a graph or a directed graph, where each processing element is represented by a vertex and the connection between two processing elements is represented by an edge (or, in case of directed connections, by an arc). When designing a communication network, there are several criteria to be considered. For example, we can require an overall balance of the system. Given that all the processing elements have the same status, the flow of information and exchange of data between processing elements will be on average faster if there is a similar number of interconnections coming in and going out of each processing element, that is, if there is a balance (or regularity) in the network. This means that the in-degree and out-degree of each vertex in a directed graph (digraph) must be regular. In this paper, we present the existence of digraphs which are not diregular (regular out-degree, but not regular in-degree) with the number of vertices two less than the unobtainable upper bound for most values of out-degree and diameter, the so-called Moore bound.