Vertex Symmetric Digraphs with Small Diameter .
F. Comellas, M. A. Fiol
Departament de Matemàtica Aplicada i Telemàtica;
Universitat Politècnica de Catalunya
Discrete Applied Mathematics, 58, pp. 1--11 (1995).
There is increasing interest in the design of dense vertex symmetric
graphs and digraphs as models of interconnection networks for
implementing parallelism. In these systems many nodes are connected
with relatively few links and short paths between them and each node
may execute, without modifications, the same communication software.
In this paper we give new families of dense vertex symmetric
$(\Delta,D)$ digraphs, that is large digraphs with a given maximum
out-degree $\Delta$ and diameter at most $D$. The digraphs are
derived from a certain family of digraphs on alphabets, proposed by
Faber and Moore, with new construction techniques that
generalize previous results from Conway and Guy.
With these families we have made important updates in the table
of largest known vertex symmetric $(\Delta, D)$ digraphs.
Load: