© 2017. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/We show that the line digraph technique, when iterated, provides dense digraphs, that is, with asymptotically large order for a given diameter (or with small diameter for a given order). This is a well- known result for regular digraphs. In this note we prove that this is also true for non-regular digraphsPostprint (author's final draft
The Moore bound for a diregular digraph of degree d and diameter k is M d;k = 1 + d + : : : + d k ...
Abelian Cayley digraphs can be constructed by using a generalization to Z(n) of the concept of congr...
Abelian Cayley digraphs can be constructed by using a generalization to Z(n) of the concept of congr...
We show that the line digraph technique, when iterated, provides dense digraphs, that is, with asymp...
AbstractIn the context of the degree/diameter problem for directed graphs, it is known that the numb...
AbstractIn the context of the degree/diameter problem for directed graphs, it is known that the numb...
summary:We compare the asymptotic growth of the order of the digraphs arising from a construction of...
summary:We compare the asymptotic growth of the order of the digraphs arising from a construction of...
The degree/diameter problem for directed graphs is the problem of determining the largest possible o...
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
<pre>The degree/diameter problem for directed graphs is the problem of determining the largest possi...
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
The Moore bound for a diregular digraph of degree d and diameter k is M d;k = 1 + d + : : : + d k ...
Abelian Cayley digraphs can be constructed by using a generalization to Z(n) of the concept of congr...
Abelian Cayley digraphs can be constructed by using a generalization to Z(n) of the concept of congr...
We show that the line digraph technique, when iterated, provides dense digraphs, that is, with asymp...
AbstractIn the context of the degree/diameter problem for directed graphs, it is known that the numb...
AbstractIn the context of the degree/diameter problem for directed graphs, it is known that the numb...
summary:We compare the asymptotic growth of the order of the digraphs arising from a construction of...
summary:We compare the asymptotic growth of the order of the digraphs arising from a construction of...
The degree/diameter problem for directed graphs is the problem of determining the largest possible o...
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
<pre>The degree/diameter problem for directed graphs is the problem of determining the largest possi...
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
The Moore bound for a diregular digraph of degree d and diameter k is M d;k = 1 + d + : : : + d k ...
Abelian Cayley digraphs can be constructed by using a generalization to Z(n) of the concept of congr...
Abelian Cayley digraphs can be constructed by using a generalization to Z(n) of the concept of congr...