A Generalization of the DeBruijn Graph for Dense Symmetric Interconnection Networks in Multicomputer Systems
Summary :
We propose a multistage DeBruijn graph, a generalization of the DeBruijn graph, for dense symmetric interconnection networks in multicomputer systems. The proposed graph is symmetric and contains remarkably large number of vertices than other known symmetric graphs such as the Boolean n-cube and the star graph for given degree and diameter.
- Publication
- IEICE TRANSACTIONS on transactions Vol.E72-E No.6 pp.691-694
- Publication Date
- 1989/06/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- LETTER
- Category
- Graphs and Networks
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yong-Seok KIM, Myunghwan KIM, "A Generalization of the DeBruijn Graph for Dense Symmetric Interconnection Networks in Multicomputer Systems" in IEICE TRANSACTIONS on transactions,
vol. E72-E, no. 6, pp. 691-694, June 1989, doi: .
Abstract: We propose a multistage DeBruijn graph, a generalization of the DeBruijn graph, for dense symmetric interconnection networks in multicomputer systems. The proposed graph is symmetric and contains remarkably large number of vertices than other known symmetric graphs such as the Boolean n-cube and the star graph for given degree and diameter.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e72-e_6_691/_p
Copy
@ARTICLE{e72-e_6_691,
author={Yong-Seok KIM, Myunghwan KIM, },
journal={IEICE TRANSACTIONS on transactions},
title={A Generalization of the DeBruijn Graph for Dense Symmetric Interconnection Networks in Multicomputer Systems},
year={1989},
volume={E72-E},
number={6},
pages={691-694},
abstract={We propose a multistage DeBruijn graph, a generalization of the DeBruijn graph, for dense symmetric interconnection networks in multicomputer systems. The proposed graph is symmetric and contains remarkably large number of vertices than other known symmetric graphs such as the Boolean n-cube and the star graph for given degree and diameter.},
keywords={},
doi={},
ISSN={},
month={June},}
Copy
TY - JOUR
TI - A Generalization of the DeBruijn Graph for Dense Symmetric Interconnection Networks in Multicomputer Systems
T2 - IEICE TRANSACTIONS on transactions
SP - 691
EP - 694
AU - Yong-Seok KIM
AU - Myunghwan KIM
PY - 1989
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E72-E
IS - 6
JA - IEICE TRANSACTIONS on transactions
Y1 - June 1989
AB - We propose a multistage DeBruijn graph, a generalization of the DeBruijn graph, for dense symmetric interconnection networks in multicomputer systems. The proposed graph is symmetric and contains remarkably large number of vertices than other known symmetric graphs such as the Boolean n-cube and the star graph for given degree and diameter.
ER -
English
