B. Bea00 and . Beauquier, Communications dans les rseaux optiques par multiplexage en longueur d'onde, 2000.

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

A. Aiello, S. N. Bhatt, F. R. Chung, A. L. Rosenberg, and R. K. Sitaraman, Augmented ring networks, IEEE Transactions on Parallel and Distributed Systems, vol.12, issue.6, 1997.
DOI : 10.1109/71.932713

B. Becchetti, P. Bertolazzi, C. Gaibisso, and G. Gambosi, On the design of eecient ATM routing schemes, 2000.

B. Burlet, P. Chanas, and O. Goldschmidt, Minimum diameter vp network design, INFORM'S FALL, 1997.

M. Burlet, P. Chanas, and O. Goldschmidt, Virtual path layout design in ATM networks, INFORMS FALL'99, 1999.

L. Becchetti and C. Gaibisso, Lower bounds for the virtual path layout problem in ATM networks, Lecture Notes in Computer Science, vol.1338, pp.375-382, 1997.
DOI : 10.1007/3-540-63774-5_116

C. Cidon, O. Gerstel, and S. Zaks, A scalable approach to routing in ATM networks, Proc. of the 8th International Workshop on Distributed A lgorithms, WDAG '94, v olume 857 of Lecture Notes in Computer Science La version longue est CGZ96a], p.2099222, 1994.
DOI : 10.1007/BFb0020435

]. I. Cgz96a, O. Cidon, S. Gerstel, and . Zaks, The layout of virtual paths in ATM networks, In ACM/IEEE Transaction on networking, vol.4, issue.6

C. Cidon, O. Gerstel, and S. Zaks, Optimal virtual path layout in ATM networks with shared routing table switches

G. , S. W. Golomb, and L. R. Welch, Perfect codes in the lee metric and the packing of polyominoes, SIAM Journal on Applied Mathematics, vol.18, p.3022317, 1970.

G. Gerstel and A. Wool, Optimal layouts on a chain ATM network (extended abstract), Proc. of the 3rd Annual European Symposium on Algorithms (ESA'95), p.5088522, 1995.

G. Gerstel and Z. Wool, Optimal layouts on a chain ATM network, DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science, vol.83, 1998.

G. , O. Gerstel, and S. Zaks, The virtual path layout problem in fast networks (extended abstract), Proc. of 13th Annual ACM Symposium on Principles of Distributed Computing (PODC'94), p.2355243, 1994.

H. Heydemann, J. Meyer, and D. Sotteau, On forwarding indices of networks, Discrete Applied Mathematics, vol.23, issue.2, pp.1033-123, 1989.
DOI : 10.1016/0166-218X(89)90022-X

A. Jarry and E. Lyon, Chemins disjoints dans les graphes symmtriques, 1999.

J. , L. R. Ford-jr, and D. R. Fulkerson, Maximal ow through a network, Canadian J. Math, vol.8, p.3999404, 1956.

K. E. Kranakis, D. Krizanc, and A. Pelc, Hop-congestion trade-oos for high-speed networks, International Journal of Foundations of Computer Science, vol.8, p.1177126, 1997.

T. Leighton and S. Rao, An approximate max--ow min-cut theorem for uniform multicommodity ow problems with application to approximation algorithms, 29th |FOCS|, p.4222431, 1988.

J. Richard, R. E. Lipton, and . Tarjan, A separator theorem for planar graphs, SIAM Journal on Applied Mathematics, vol.36, issue.2, p.1777189, 1979.

]. B. Bibliographie-bol85 and . Bollobas, Random Graphs, 1985.

F. , L. R. Ford, and D. R. Fulkerson, Maximal ow through a network, Canadian J. Math, vol.8, p.3999404, 1956.
DOI : 10.1007/978-0-8176-4842-8_15

]. S. Kun74 and . Kundu, Bounds on the number of disjoint spanning trees, Journal of Combinatorial Theory, vol.17, pp.199-203, 1974.

L. , L. Lovsz, and M. D. Plummer, Matching Theory, Annals of Discrete Mathematics, vol.121, issue.29, p.126, 1986.

A. W. Aiello, S. Bhatt, F. Chung, A. Rosenberg, and R. Sitaraman, Augmented ring networks, IEEE Transactions on Parallel and Distributed Systems, vol.12, issue.6, 1997.
DOI : 10.1109/71.932713

L. Becchetti, P. Bertolazzi, C. Gaibisso, and G. Gambosi, On the design of eecient ATM routing schemes, 1997.

M. Burlet, P. Chanas, and O. Goldschmidt, Optimization of VP layout in ATM networks, 1998.

B. Bermond, L. Gargano, S. Perennes, A. Rescigno, and U. Vaccaro, EEective collective communication in optical networks, Proceedings of ICALP 96, p.5744585, 1996.

]. B. Bol78 and . Bollobbs, Extremal Graph Theory, 1978.

P. Chanas and O. Goldschmidt, Conception de rrseau de VP de diammtre minimum pour les rrseaux ATM, Road-f'98, p.38840, 1998.

P. Chanas and C. Sophia, Dimensionnement de rseaux ATM, 1998.

. De-95-]-martin-de-pricker, Asynchronous Transfer Mode, Solution for Broadband ISDN, 1995.

D. Y. Dinitz, M. Feighlstein, and S. Zaks, On optimal graphs embedded into paths and rings, with analysis using l1-spheres, Proc. 23rd I n t . Workshop on Graph-Theoretic Concepts in Computer Science (WG)

O. Delmas and S. Perennes, Circuit-switched gossiping in 3-dimensional torus networks, Proc. Euro-Par'96 Parallel Processing / 2nd Int. EURO-PAR Conference, p.3700373, 1996.
DOI : 10.1007/3-540-61626-8_48
URL : https://hal.archives-ouvertes.fr/hal-00407414

E. T. Eilam, M. Flammini, and S. Zaks, A complete characterization of the path layout construction problem for ATM networks with given hop count and load, 24th International Colloquium on Automata, Languages and Programming (ICALP), volume 1256 of Lecture Notes in Computer Science, p.5277537, 1997.

M. Feighlstein and S. Zaks, Duality i n c hain ATM virtual path layouts, 4th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 1997.

G. O. Gerstel, I. Cidon, and S. Zaks, The layout of virtual paths in ATM networks, IEEE/ACM Transactions on Networking, vol.4, issue.6, pp.8733-884, 1996.
DOI : 10.1109/90.556344

G. O. Gerstel, A. Wool, and S. Zaks, Optimal layouts on a chain ATM network, 3rd Annual European Symposium on Algorithms, volume LNCS 979, p.5088522, 1995.

]. O. Gz94a, S. Gerstel, and . Zaks, A new characterization of tree medians with applications to distributed algorithms. Networks, p.23329, 1994.

O. Gerstel and S. Zaks, The virtual path layout problem in fast networks, Symposium on Principles of Distributed Computing (PODC '94), p.2355243, 1994.

J. Hong, K. Mehlhorn, and A. L. Rosenberg, Cost trade-oos in graph embedding with applications, J. ACM, p.30, 1983.

M. Heydemann, J. Meyer, and D. Sotteau, On forwarding indices of networks, Discrete Applied Mathematics, vol.23, issue.2, p.1033123, 1989.
DOI : 10.1016/0166-218X(89)90022-X

D. Kofman and M. Gagnaire, Rseaux Haut DDbit, rseaux ATM, rseaux locaux et rseaux tout-optiques, 1998.

E. Kranakis, D. Krizanc, A. Pelc, L. T. Leighton, and S. Rao, Hop-congestion trade-oos for high-speed networks An approximate max--ow min-cut theorem for uniform multicommod ity ow problems with applications to approximation algorithms, 29th Symp. on Foundations of Computer Science, pp.1177126-4222431, 1988.

Y. Manoussakis and Z. Tuza, The forwarding index of directed networks, Discrete Applied Mathematics, vol.68, issue.3, p.2799291, 1996.
DOI : 10.1016/0166-218X(95)00072-Y

]. A. Ros80 and . Rosenberg, Issues in the study of graph embeddings, Proceedings of the International Workshop on Graphtheoretic Concepts in Computer Science, p.1500176, 1980.

]. P. Sol95 and . Soll, Expanding and forwarding SV96] L. Stacho and I. Vrt'o. Virtual path layouts for some bounded degree networks, Structure, Information and Communication Complexity, 3rd Colloquium, SIROCCO, pp.67778-2699278, 1995.

]. S. Zak97 and . Zaks, Path layout in ATM networks -a survey, The DIMACS Workshop on Networks in Distributed Computing, 1997.

]. B. Zel68 and . Zelinka, Medians and peripherians of trees, Arch. Math, pp.87795-129, 1968.

. Ddfinition, Si X est un ensemble non vide, une permutation de X est une bijection : X ! X. O n note X l'ensemble des permutations de X

. Ainsi, i n sans rrptition de tous les llments de X ddcrit une permutation . On note une permutation sur f12 : : : n g par la liste des images) : : : (n)). Par exemple, soient = (321) et = (231) des permutations de f123g

. Ddfinition, Deux permutations sont disjointes si leurs supports sont disjoints

. Ddfinitions, Un groupe est un ensemble muni d'une loi de composition associative , posssdant u n n l m e n t neutre I et pour laquelle tout llment est inversible. Un homomorphisme de groupes entre deux groupes (GG) et (HH) est une application de G vers H telle que (g g 0 ) = (g)

. Si-est-bijective, on l'appelle un isomorphisme s i G = H, u n endomorphisme si les deux conditions sont vriiies

. Ddfinitions, X est appell le groupe symmtrique sur X et le cas particulier n est le groupe symmtrique n llments. Un groupe de permutations est un sous-groupe du groupe n

G. Ddfinitions, G. Soient, and G. Un-groupe-et-s-une-partie-de, L e sous-groupe engendr par S est le plus petit groupe contenant S

. Actions-de-groupes-ddfinitions, G. Soient, and . Un-groupe, On appelle action de groupe G sur E une application : G E ! E oo (ggx) est nott g(x), satisfaisant, pourtous ggg 0 2 G et x 2 E, les conditions : g(g 0 (x)) = gg 0 (x) I(x) = x On dit que G agit transitivement sur l'ensemble E si pour tout couple, p.4312, 2413.

. Ddfinitions, Un isomorphisme entre deux graphes ; et ; 0 est une bijection entre V (;) et V (; 0 ) telle que xxy] est une arrte de ; si et seulement si

. Est-une-arrte-de, Si ; et ; 0 sont orientts la condition se traduit par : (xxy) est un arc de ; si et seulement si ((x)(y)) est un arc de ; 0 . Un automorphisme d'un graphe ; est un isomorphisme de

. Comme-le-connrme-le-graphe-de-petersen, sur la gure 6.2), les graphes sommet-transitifs ne sont pas tous des graphes de Cayley Pour prouver que le graphe de Petersen n'est pas un graphe de Cayley, on peut faire une recherche exhaustive des graphes de Cayley d'ordre 8, 8 and 2, respectively. By Corollary 7.20, we cannot nd a complete rotation for this structure. Furthermore, this graph is not arc-transitive. In fact, consider its vertices as labeled by Z 8 . It is easy to verify that the edge 01 belongs to only one 4-cycle (0154) Thus by Corollary 7

F. In, the following question is settled. If ; and ; 0 are two graphs having a (complete) rotation, how about the Cartesian product

. Proof, By hypothesis, S is the set of the transpositions hiiji, for 1 i k and k + 1 j n. Consider the permutation deened on X by =

A. Arnaudies and J. Bertin, Groupes, alggbres et ggommtrie, Ellipses, vol.1, 1993.

A. , S. Akers, and B. Krishnamurthy, A group theoretic model for symmetric interconnection networks, IEEE Trans. Comput, vol.38, p.5555566, 1989.

B. Bermond, F. Comellas, and D. F. Hsu, Distributed loop computer networks: a s u r v ey, J. Parallel Distrib. Comput, vol.24, p.2210, 1995.

N. Big74 and . Biggs, Algebraic Graph Theory, 1974.

B. Bermond, T. Kodate, and S. Perennes, Gossiping in Cayley graphs by p a c kets, Conf. CCS95 (8 th Franco-Japanese and 4 th Franco-Chinese Conf, p.3011305, 1995.

B. , N. L. Biggs, and A. T. White, Permutation groups and combinatorial structures, Lecture Note Series, vol.33, 1979.
DOI : 10.1017/cbo9780511600739

C. , H. S. Coxeter, and W. O. Moser, Generators and relations for discrete groups, 1972.

D. Dds97 and . Dssrable, A family of Cayley graphs on the hexavalent grid. Special issue on network communications, Discrete Appl. Math, 1997.

]. C. Del97 and . Delorme, Isomorphisms of transposition graphs, 1997.

D. , K. Day, and A. Tripathi, Arrangements graphs : a class of generalized star graphs, Inform. Process. Lett, vol.42, p.2355241, 1992.

F. , P. Fragopoulou, and S. G. Akl, Spanning graphs with applications to communication on a subclass of the Cayley graph based networks, Discrete Appl. Math

]. J. Fou97 and . Fournier, Le groupe d'automorphismes des graphes de cayley engendrrs par des transpositions, 1997.

P. Fraigniaud and J. G. Peters, Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs, Networks, vol.3, issue.3, 1994.
DOI : 10.1002/net.1033

F. Fragopoulou, Communication and fault tolerance algorithms on a class of interconnection networks, 1995.

]. F. Har69 and . Harary, Graph Theory, 1969.

H. , R. Hemminger, and L. Beineke, line graphs and line digraphs, Selected topics in graph theory, pp.271-305, 1978.

H. Heydemann, Cayley graphs and interconnection networks, Proceedings Graph Symmetry, 1996.
DOI : 10.1007/978-94-015-8937-6_5
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.27.9995

]. D. Joh76 and . Johnson, Presentation of groups, v olume 22, Lecture Note Series, 1976.

]. W. Knn75 and . Knndel, New gossips and telephones, Discrete Mathematics, vol.95, issue.13, 1975.

L. S. Lakshmivarahan, J. Jwo, and S. K. , Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey, Parallel Computing, vol.19, issue.4, p.3611407, 1993.
DOI : 10.1016/0167-8191(93)90054-O

M. Marlin, Rotations complltes dans les graphes de Cayley, 1996.

J. S. Derek and . Robinson, A course in theory of groups, second edition, 1996.

G. Sab58 and . Sabidussi, On a class of xed-point-free graphs, Proc. Amer, p.8000804, 1958.

G. Sab60 and . Sabidussi, Graph multiplication, Math. Zeitschr, vol.72, p.4466457, 1960.

]. Sac97 and . Sacll, Diameter of some Cayley graphs, 1997.

M. E. Wat70 and . Watkins, Connectivity of transitive graphs, J. Combin. Theory, vol.8, p.23329, 1970.

M. E. Wat71 and . Watkins, On the action of non-abelian groups on graphs, J. Combin. Theory, vol.11, p.955104, 1971.

]. A. Whi84 and . White, Graphs, groups and surfaces, North Holland Mathematical Studies, vol.8, 1984.