Author:
Bermond Jean-Claude,Ergincan Fahir,Syska Michel
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Bermond, J.-C., Dawes, R.W., Ergincan, F.Ö.: De Bruijn and Kautz bus networks. Networks 30, 205–218 (1997)
2. Bermond, J.-C., Delorme, C., Quisquater, J.-J.: Tables of large graphs with given degree and diameter. Inform. Process. Lett. 15(1), 10–13 (1982)
3. Bermond, J.-C., Delorme, C., Quisquater, J.-J.: Grands graphes de degré et diamètre fixés. In: Combinatorial mathematics (Marseille-Luminy, 1981), North-Holland Math.Stud., vol. 75, pp. 65–73. North-Holland, Amsterdam (1983)
4. Bermond, J.-C., Delorme, C., Quisquater, J.-J.: Strategies for interconnection networks: some methods from graph theory. J. Parallel Distributed Computing 3(4), 433–449 (1986)
5. Bermond, J.-C., Delorme, C., Quisquater, J.-J.: Table of large (Δ,d)-graphs. Discrete Applied Mathematics 37/38, 575–577 (1992)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献