Isomorphisms of the De Bruijn digraph and free-space optical networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Networks Year : 2002

Isomorphisms of the De Bruijn digraph and free-space optical networks

Abstract

The de Bruijn digraph B(d, D) has degree d, diameter D, dD vertices, and dD+1 arcs. It is usually defined by words of size D on an alphabet of cardinality d, through a cyclic left-shift permutation on the words, after which the rightmost symbol is changed. In this paper, we show that any digraph defined on words of a given size, through an arbitrary permutation on the alphabet and an arbitrary permutation on the word indices, is isomorphic to the de Bruijn digraph, provided that this latter permutation is cyclic. We use this result to improve from O(dD+1) to the number of lenses required for the implementation of B(d, D) by the Optical Transpose Interconnection System proposed by Marsden et al. [Opt Lett 18 (1993), 1083-1085].
Fichier principal
Vignette du fichier
CFP-Networks-ac02.pdf (272.75 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00429201 , version 1 (01-11-2009)

Identifiers

Cite

David Coudert, Afonso Ferreira, Stéphane Pérennes. Isomorphisms of the De Bruijn digraph and free-space optical networks. Networks, 2002, 40 (3), pp.155 - 164. ⟨10.1002/net.10043⟩. ⟨inria-00429201⟩
149 View
169 Download

Altmetric

Share

Gmail Facebook X LinkedIn More