A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
A prominent problem in Graph Theory is to find extremal graphs or digraphs with restrictions in their diameter, degree and number of vertices. Here we obtain a new family of digraphs with minimal diameter, that is, given the number of vertices and out-degree there is no other digraph with a smaller diameter. This new family is called modified cyclic digraphs MCK(d,ℓ) and it is derived from the Kautz digraphs K(d,ℓ). non-regular digraphs with minimal diameter given their number of vertices andarXiv:1512.05917v1 fatcat:yen3e24yajeevnzr65z55sjl4a