Premium
Generalized de Bruijn digraphs
Author(s) -
Du D. Z.,
Hwang F. K.
Publication year - 1988
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230180105
Subject(s) - de bruijn sequence , embedding , mathematics , combinatorics , routing (electronic design automation) , link (geometry) , de bruijn graph , discrete mathematics , computer science , artificial intelligence , computer network
We show that the digraphs proposed independently by Imase and Itoh, and Reddy, Pradhan and Kuhl to minimize diameters essentially retain all the nice properties of de Bruijn digraphs and yet are applicable to any number of nodes. In particular we give results on the number of loops, the link connectivities and connectivities, the embedding properties and the self‐routing properties for these digraphs.