Multidimensional linear congruential graphs

C. C. Koung; J. Opatrny

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1994)

  • Volume: 28, Issue: 3-4, page 187-199
  • ISSN: 0988-3754

How to cite


Koung, C. C., and Opatrny, J.. "Multidimensional linear congruential graphs." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 28.3-4 (1994): 187-199. <>.

author = {Koung, C. C., Opatrny, J.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {linear congruential graph; Bruijn graphs; chordal graphs},
language = {eng},
number = {3-4},
pages = {187-199},
publisher = {EDP-Sciences},
title = {Multidimensional linear congruential graphs},
url = {},
volume = {28},
year = {1994},

AU - Koung, C. C.
AU - Opatrny, J.
TI - Multidimensional linear congruential graphs
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1994
PB - EDP-Sciences
VL - 28
IS - 3-4
SP - 187
EP - 199
LA - eng
KW - linear congruential graph; Bruijn graphs; chordal graphs
UR -
ER -


  1. 1. J. C. BERMOND, C. DELORME and J. J. QUISQUATER, Strategies for interconnection networks: some methods from graph theory, Journal of Parallel and Distributed Computing, 1986, 3, pp. 433-449. 
  2. 2. J. C. BERMOND, C. PEYRAT, de BRUIJN and KAUTZ networks: a competitor for the hypercube? Hypercube and Distributed Computers, 1989, pp. 279-294. 
  3. 3. J. A. BONDY and U. S. R. MURTY, Graphs Theory with Applications, North Holland, 1976. Zbl1226.05083
  4. 4. F. R. K. CHUNG, Diameters of graphs: old problems and new results, Proceedings of the 18th South-Eastern Conference on Combinatorics, Graph Theory, and Computing, Congressus Numerantium, 1987, pp. 295-317. Zbl0695.05029MR945240
  5. 5. C. DELORME, A Table of Large Graphs of Small Degrees and Diameters, personal communication, 1990. 
  6. 6. D. Z. DU and F. K. HWANG, Generalized de Bruijn Digraphs, Networks, 1988, 18, pp. 28-38. Zbl0654.05036MR926031
  7. 7. B. ELPAS, Topological Constrains on Interconnection Limited Logic, Switching Circuits Theory and Logical Design, 1964, 5, pp. 133-147. 
  8. 8. M. IMASE and M. ITOH, Design to minimize diameter on building block network, IEEE Trans. on Computers, 1981, C-30, pp. 439-442. Zbl0456.94030MR626733
  9. 9. W. H. KAUTZ, Bounds on directed (d, k) graphs, Theory of Cellular Logic Networks and Machines, SRI Project 7258, 1968, pp. 20-28. 
  10. 10. D. E. KNUTH, The art of computer programming, Seminumerical Algorithms, Addison-Wesley, II, 1972. Zbl0191.18001MR378456
  11. 11. C. C. KOUNG, Multi-dimensional Linear Congruential Network Models, Master's Thesis, Dept. of Comp. Sci. Concordia University, Montreal, 1993. Zbl0804.05048
  12. 12. W. LELAND and M. SOLOMON, Dense trivalent graphs for processor interconnection, IEEE Trans, on Computers, 1982, 31, No. 3, pp. 219-222. Zbl0477.68068MR648372
  13. 13. J. OPATRNY and D. SOTTEAU, Linear Congruential Graphs, Graph Theory, Combinatorics, Algorithms, and Applications, SIAM proceedings series, 1991, pp. 404-426. Zbl0739.05074MR1132923
  14. 14. J. OPATRNY, D. SOTTEAU, N. SRINIVASAN and K. THULASIRAMAN, DCC Linear Congruential Graphs, a New Network Model, IEEE Trans. Comput., to appear. MR1376915
  15. 15. M. R. SAMANTHAM and D. K. PRADHAM, The de Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI, IEEE Trans. Cornput., 1989,38, No. 4, pp. 567-581. Zbl0671.94028MR984681

NotesEmbed ?


You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.


Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.