J. Bermond, C. Delorme, and J. Quisquater, Tables of large graphs wh given degree and diameter, Information Processing Letters, vol.15, issue.1, pp.10-13, 1982.
DOI : 10.1016/0020-0190(82)90076-X

J. Bermond, C. Delorme, and J. Quisquater, Grands Graphes De Degr?? Et Diam??tre Fix??s, Combinatorial mathematics, pp.65-73, 1981.
DOI : 10.1016/S0304-0208(08)73374-7

J. Bermond, C. Delorme, and J. Quisquater, Strategies for interconnection networks: Some methods from graph theory, Journal of Parallel and Distributed Computing, vol.3, issue.4, pp.433-449, 1986.
DOI : 10.1016/0743-7315(86)90008-0

J. Bermond, C. Delorme, and J. Quisquater, Table of large (?, d)-graphs, Discrete Applied Mathematics, vol.3738, pp.575-577, 1992.

J. Bermond and F. ¨. Ergincan, Bus interconnection networks, Bus interconnection networks, pp.1-15, 1996.
DOI : 10.1016/0166-218X(95)00046-T
URL : http://doi.org/10.1016/0166-218x(95)00046-t

D. Ferrero and C. Padró, Connectivity and fault-tolerance of hyperdigraphs, Discrete Applied Mathematics, vol.117, issue.1-3, pp.15-26, 2002.
DOI : 10.1016/S0166-218X(00)00333-4

D. Ferrero and C. Padró, Partial line directed hypergraphs. Networks, pp.61-67, 2002.
DOI : 10.1002/net.10013

M. A. Fiol, J. L. Yebra, and I. A. , Line Digraph Iterations and the (d, k) Digraph Problem, IEEE Transactions on Computers, vol.33, issue.5, pp.33400-403, 1984.
DOI : 10.1109/TC.1984.1676455

N. Homobono and C. Peyrat, Connectivity of Imase and Itoh digraphs, IEEE Transactions on Computers, vol.37, issue.11, pp.1459-1461, 1988.
DOI : 10.1109/12.8718

K. Menger, Zur allgemeinen Kurventheorie, Fundamenta Mathematicae, vol.10, pp.96-115, 1927.
DOI : 10.1007/bf02307626

O. Ore, Theory of Graphs, 1962.
DOI : 10.1090/coll/038

T. E. Stern and K. Bala, Multiwavelength Optical Networks: A Layered Approach, 1999.