par Sampels, Michaël 
Référence Lecture notes in computer science, 3019, page (42-49)
Publication Publié, 2004
Référence Lecture notes in computer science, 3019, page (42-49)
Publication Publié, 2004
Article révisé par les pairs
| Résumé : | The transmission of a strongly connected digraph D is defined as the sum of all distances in D. A lower bound for the transmission in terms of the order n and the maximal outdegree Δ+ of D can be regarded as a generalization of the Moore bound for digraphs. Bridges and Toueg showed that Moore digraphs in the strong sense exist only for the trivial cases Δ+ = 1 or Δ+ = n-1. Using techniques founded on Cayley digraphs, we constructed vertex-symmetric generalized Moore digraphs. Such graphs are applicable to interconnection networks of parallel computers, routers, switches, backbones, etc. © Springer-Verlag Berlin Heidelberg 2004. |
