Abstract
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.
Cite
CITATION STYLE
Sampels, M. (2004). On generalized moore digraphs. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3019, 42–49. https://doi.org/10.1007/978-3-540-24669-5_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
