A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; 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 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, ). It is well-known that the Kautz digraphs K(d, ) have the smallest diameter amongdoi:10.2298/fil1720551b fatcat:foxmp3fmhjdkrei4p3323m4tce