]. N. Alo93 and . Alon, On the edge-expansion of graphs, Combinatroics, Probability and Computing, vol.11, pp.1-10, 1993.

]. L. Bas81 and . Bassalygo, Asymptotically optimal switching circuits, Problemy Pederachi Informatsii, vol.17, pp.81-88, 1981.

E. [. Beauquier and . Darrot, Arbitrary size Waksman networks, AlgoTel, pp.95-100, 1999.

J. Bermond, E. Darrot, and O. Delmas, Design of fault-tolerant networks for satellites (TWTA redundancy), Networks, vol.40, issue.4, pp.202-207, 2002.
DOI : 10.1002/net.10044

URL : https://hal.archives-ouvertes.fr/hal-00307611

. Bdh-+-03-]-j-c, O. Bermond, F. Delmas, M. Havet, S. Montassier et al., Réseaux de télécommunications minimaux embarqués tolérants aux pannes, Algotel, pp.27-32, 2003.

J. Bermond, F. Giroire, and S. Pérennes, Design of minimal fault tolerant networks: Constructions, Submitted to the International Workshop of Graph- Theoric Concepts (WG), 2006.
URL : https://hal.archives-ouvertes.fr/hal-00512282

J. Bermond, F. Havet, and D. Tóth, Fault tolerant on-board networks with priorities, Networks, vol.6, issue.1, pp.9-25, 2006.
DOI : 10.1002/net.20094

URL : https://hal.archives-ouvertes.fr/inria-00070640

]. M. Bkp-+-81, R. Blum, C. Karp, O. Papadimitriou, M. Vornberger et al., The complexity of testing whether a graph is a superconcentrator, Proc. Letters, pp.164-167, 1981.

]. B. Bol88 and . Bollobás, The isoperimetric number of random regular graphs, European Journal of Combinatroics, vol.9, issue.3, pp.241-244, 1988.

]. F. Chu79 and . Chung, On concentrators, superconcentrators, generalizers and nonblocking networks, Bell System Tech. J, vol.58, pp.1765-1777, 1979.

M. Capalbo, O. Reingold, S. Vadhan, and A. Wigderson, Randomness conductors and constant-degree lossless expanders, STOCS, pp.659-668, 2002.
DOI : 10.1109/ccc.2002.1004327

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.123.6852

O. Delmas, F. Havet, M. Montassier, and S. Pérennes, Design of fault tolerant on-board networks Laboratoire bordelais de recherche en informatique (LaBRI), 2005.

]. F. Hav06 and . Havet, Repartitors, selectors and superselectors, 2006.

R. [. Monien and . Preis, Upper bounds on bissection width of 3-and 4-reg- ular graphs. Mathematical foundations of computer science, Lecture Notes in Comput. Sci, pp.524-536, 2001.

]. M. Mur03 and . Murty, Ramanujan graphs, Journal of the Ramanujan Mathematical Society, vol.18, pp.33-52, 2003.

D. [. Ngo and . Du, Notes on the Complexity of Switching Networks, pp.307-367, 2001.
DOI : 10.1007/978-1-4613-0281-0_14

N. [. Read and . Wormald, Number of labeled 4-regular graphs, Journal of Graph Theory, vol.686, issue.2, pp.203-212, 1980.
DOI : 10.1002/jgt.3190040208

I. Unité-de-recherche-inria-sophia and . Antipolis, route des Lucioles -BP 93 -06902 Sophia Antipolis Cedex (France) Unité de recherche INRIA Futurs : Parc Club Orsay Université -ZAC des Vignes 4, 2004.

I. Unité-de-recherche and . Lorraine, Technopôle de Nancy-Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602 Villers-lès-Nancy Cedex (France) Unité de recherche INRIA Rennes : IRISA, Campus universitaire de Beaulieu -35042 Rennes Cedex (France) Unité de recherche INRIA Rhône-Alpes : 655, avenue de l'Europe -38334 Montbonnot Saint-Ismier (France) Unité de recherche INRIA Rocquencourt, Domaine de Voluceau -Rocquencourt -BP 105 -78153 Le Chesnay Cedex

I. De-voluceau-rocquencourt, BP 105 -78153 Le Chesnay Cedex (France) http://www.inria.fr ISSN, pp.249-6399