summary:We compare the asymptotic growth of the order of the digraphs arising from a construction of Comellas and Fiol when applied to Faber-Moore digraphs versus plainly the Faber-Moore digraphs for the corresponding degree and diameter
We consider the degree-diameter problem for undirected and directed circulant graphs. To date, attem...
We consider the degree-diameter problem for undirected and directed circulant graphs. To date, attem...
The largest order n(d,k) of a graph of maximum degree d and diameter k cannot exceed the Moore bound...
summary:We compare the asymptotic growth of the order of the digraphs arising from a construction of...
We show that the line digraph technique, when iterated, provides dense digraphs, that is, with asymp...
© 2017. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativec...
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 degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
We consider the problem of finding largest vertex-transitive graphs of given degree and diameter. Us...
<pre>The degree/diameter problem for directed graphs is the problem of determining the largest possi...
The degree/diameter problem for directed graphs is the problem of determining the largest possible o...
We consider the degree-diameter problem for undirected and directed circulant graphs. To date, attem...
We consider the degree-diameter problem for undirected and directed circulant graphs. To date, attem...
We consider the degree-diameter problem for undirected and directed circulant graphs. To date, attem...
The largest order n(d,k) of a graph of maximum degree d and diameter k cannot exceed the Moore bound...
summary:We compare the asymptotic growth of the order of the digraphs arising from a construction of...
We show that the line digraph technique, when iterated, provides dense digraphs, that is, with asymp...
© 2017. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativec...
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 degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
We consider the problem of finding largest vertex-transitive graphs of given degree and diameter. Us...
<pre>The degree/diameter problem for directed graphs is the problem of determining the largest possi...
The degree/diameter problem for directed graphs is the problem of determining the largest possible o...
We consider the degree-diameter problem for undirected and directed circulant graphs. To date, attem...
We consider the degree-diameter problem for undirected and directed circulant graphs. To date, attem...
We consider the degree-diameter problem for undirected and directed circulant graphs. To date, attem...
The largest order n(d,k) of a graph of maximum degree d and diameter k cannot exceed the Moore bound...
DOI
Add to ORKG