no. 3-4
Multidimensional linear congruential graphs
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 28 (1994) no. 3-4, pp. 187-199. 
@article{ITA_1994__28_3-4_187_0,
     author = {Koung, C. C. and Opatrny, J.},
     title = {Multidimensional linear congruential graphs},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {187--199},
     publisher = {EDP-Sciences},
     volume = {28},
     number = {3-4},
     year = {1994},
     mrnumber = {1282444},
     zbl = {0883.68101},
     language = {en},
     url = {http://archive.numdam.org/item/ITA_1994__28_3-4_187_0/}
}
TY  - JOUR
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
SP  - 187
EP  - 199
VL  - 28
IS  - 3-4
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1994__28_3-4_187_0/
LA  - en
ID  - ITA_1994__28_3-4_187_0
ER  - 
%0 Journal Article
%A Koung, C. C.
%A Opatrny, J.
%T Multidimensional linear congruential graphs
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1994
%P 187-199
%V 28
%N 3-4
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1994__28_3-4_187_0/
%G en
%F ITA_1994__28_3-4_187_0
Koung, C. C.; Opatrny, J. Multidimensional linear congruential graphs. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 28 (1994) no. 3-4, pp. 187-199. http://archive.numdam.org/item/ITA_1994__28_3-4_187_0/

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. J. C. Bermond, C. Peyrat, de BRUIJN and KAUTZ networks: a competitor for the hypercube? Hypercube and Distributed Computers, 1989, pp. 279-294.

3. J. A. Bondy and U. S. R. Murty, Graphs Theory with Applications, North Holland, 1976.

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. | MR | Zbl

5. C. Delorme, A Table of Large Graphs of Small Degrees and Diameters, personal communication, 1990.

6. D. Z. Du and F. K. Hwang, Generalized de Bruijn Digraphs, Networks, 1988, 18, pp. 28-38. | MR | Zbl

7. B. Elpas, Topological Constrains on Interconnection Limited Logic, Switching Circuits Theory and Logical Design, 1964, 5, pp. 133-147.

8. M. Imase and M. Itoh, Design to minimize diameter on building block network, IEEE Trans. on Computers, 1981, C-30, pp. 439-442. | MR | Zbl

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. D. E. Knuth, The art of computer programming, Seminumerical Algorithms, Addison-Wesley, II, 1972. | MR

11. C. C. Koung, Multi-dimensional Linear Congruential Network Models, Master's Thesis, Dept. of Comp. Sci. Concordia University, Montreal, 1993.

12. W. Leland and M. Solomon, Dense trivalent graphs for processor interconnection, IEEE Trans, on Computers, 1982, 31, No. 3, pp. 219-222. | MR | Zbl

13. J. Opatrny and D. Sotteau, Linear Congruential Graphs, Graph Theory, Combinatorics, Algorithms, and Applications, SIAM proceedings series, 1991, pp. 404-426. | MR | Zbl

14. J. Opatrny, D. Sotteau, N. Srinivasan and K. Thulasiraman, DCC Linear Congruential Graphs, a New Network Model, IEEE Trans. Comput., to appear. | MR

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. | MR | Zbl