Références

[1]

B.W. Adren and K.W. Tang. Representation and routing of Cayley graphs. IEEE Trans. Communications, 39:1533--1537, 1991.

[2]

Sheldon Akers and Balakrishnan Krishnamurthy. Group graphs as interconnection networks. In Proc. 14th Int. Conf. Fault Tolerant Comput., pages 422--427, 1984.

[3]

Sheldon Akers and Balakrishnan Krishnamurthy. On group graphs and their fault tolerance. IEEE Trans. Comput., C-36:885--888, 1987.

[4]

Sheldon Akers and Balakrishnan Krishnamurthy. A group theoretic model for symmetric interconnection networks. IEEE Trans. Comput., 38:555--566, 1989.

[5]

Selim G. Akl, Paraskevi Fragopoulou, and Henk Meijer. Optimal communication primitives on the generalized hypercube network. J. Parallel Distrib. Comp., 32:173--187, 1996.

[6]

Selim G. Akl and Ke Qiu. A novel routing scheme on the star and pancake networks and its applications. Parallel Comput., pages 95--101, 1993.

[7]

B. Alspach and Y Qin. Hamilton-connected cayley graphs on hamiltonian groups. European Journal of Combinatorics, 22:777--787, 2001.

[8]

Brian Alspach. Cayley graphs with optimal fault tolerance. IEEE Trans. Comput., 41(10):1337--1339, 1992.

[9]

Fred Annexstein and Marc Baumslag. On the diameter and bisection size of Cayley graphs. Math. System Theory, 26:271--291, 1993.

[10]

Fred Annexstein, Marc Baumslag, and Arnold L. Rosenberg. Group action graphs and parallel architectures. SIAM J. Comput., 19:544--569, 1990.

[11]

L. Babai, W. M. Kantor, and A. Lubotzky. Small diameter Cayley graphs for finite simple groups. European J. Combin., 10:507--522, 1989.

[12]

L. Babai, E.M. Luks, and A. Seress. Fast management of the permutation groups. SIAM J. Comput., 26:1310--1342, 1997.

[13]

L. Babai and A. Seress. On the diameter of Cayley graphs of the symmetric group. J. Combin. Theory Ser. A, 49:175--179, 1988.

[14]

R. Bacher. Valeur propre minimale du laplacien de Coxeter pour le groupe symétrique. J. of Algebra, 167:460--472, 1994.

[15]

D. Barth, A. Germa, M.-C. Heydemann, and D. Sotteau. Emulating networks by bus networks: Application to trees and hypermeshes. In Structure, Information and Communication Complexity, Int. Inf. Series 6, pages 241--254. Carlton University Press, 1997. Rapport LRI 1996 , No 1073.

[16]

Marc Baumslag. Cayley networks : a group-theoretic approach to the design and analysis of parallel networks. PhD thesis, The City University of New-York, 1991.

[17]

Marc Baumslag. On the fault tolerance of quasi-minimal Cayley networks. In Advances in Comput. and Inf.,ICCI'91, number 497 in Lecture Notes in Comput. Sci., pages 431--442. Springer Verlag, 1991.

[18]

J.-C. Bermond, F. Comellas, and D. F. Hsu. Distributed loop computer networks: a survey. J. Parallel Distrib. Comput., 24:2--10, 1995.

[19]

J.-C. Bermond, C. Delorme, and J.J. Quisquater. Strategies for interconnection networks: some methods from graph theory. J. Parallel Distrib. Comput., 3:433--449, 1986.

[20]

Jean-Claude Bermond, Charles Delorme, and Jean-Jacques Quisquater. Table of large (D, d) graphs. Discrete Appl. Math., 37/38:575--577, 1992.

[21]

Jean-Claude Bermond, Takako Kodate, and Stephane Perennes. Gossiping in Cayley graphs by packets. In Conf. CCS95 (8 th Franco-Japanese and 4 th Franco-Chinese Conf. Combin. Comput. Sci. (Brest July 1995)), volume 1120 of Lecture Notes in Comput. Sci., pages 301--305. Springer Verlag, 1996.

[22]

P. Berthomé, A. Ferreira, and S. Perennes. Optimal information dissemination in star and pancake networks. In Proc. of the 5th IEEE Symp. Parallel Distribut. Process., pages 720--724. IEEE Press, 1993.

[23]

L.N. Bhuyan and D.P. Agraval. Generalized hypercubes and hyperbus structures for a computer network. IEEE Trans. Comput., C-33:323--333, 1984.

[24]

Norman Biggs. Algebraic graph theory. Number 67 in Cambridge Tracts in Mathematics. Cambridge University Press, 1974.

[25]

G. Birkhoff and S. MacLane. Algèbre. Number xxxv-xxxvi in Cahiers Scientifiques. Gauthier-Villars, 1971.

[26]

F. Boesch and R. Tindell. Circulant and their connectivities. J. of Graph Theory, 8:487--499, 1984.

[27]

I. Bond and C. Delorme. A note on partial Cayley graphs. Discrete Math., 114:63--74, 1993.

[28]

A Bouabdallah, Marie-Claude Heydemann, Jaroslav Opatrny, and Dominique Sotteau. Embeddings of complete binary trees into star graphs. In 19th Conf. on Math. Foundations of Comput. Sci., number 841 in Lecture Notes in Comput. Sci., pages 266--275. Kosice, Springer Verlag, 1994.

[29]

Andries E. Brouwer and Willem H. Haemers. Association schemes, chapter 15, pages 747--771. Volume I of Graham et al. [82], 1995.

[30]

J.M. Brunat, M. Espona, M.A. Fiol, and O. Serra. On Cayley line digraphs. Discrete Math., 138:147--159, 1995.

[31]

Lowell Campbell, Gunnar Carlsson, Michael Dinneen, Vance Faber, Michael Fellows, Michael Langston, James Moore, Andrew Mullhaupt, and Harlan Sexton. Small diameter symmetric networks from linear groups. IEEE Trans. Comput., 41:218--220, 1992.

[32]

J. J. Cannon. Construction of defining relators for finite groups. Discrete Math., 5:105--129, 1973.

[33]

A. Cayley. On the theory of groups. Amer. J. Math, 11:139--157, 1889.

[34]

Arthur Cayley. The theory of groups : graphical representations. Amer. J. of Math., 1:174--176, 1878.

[35]

F.R.K. Chung, V. Faber, and Thomas A. Manteuffel. An upper bound on the diameter of a graph from eigenvalues associated with its laplacian. SIAM J. Discrete Math., 7:443--457, 1994.

[36]

F. Comellas and M.A. Fiol. Vertex-symmetric digraphs with small diameter. Discrete Appl. Math., 58:1--11, 1995.

[37]

F. Comellas and M. Mitjana. Broadcasting in cycle prefix digraphs. Discrete Appl. Math., 83:31--39, 1998.

[38]

G. Cooperman and L. Finkelstein. New methods for using Cayley graphs in interconnection networks. Discrete Appl. Math., 37-38:95--118, 1992. Special issue on interconnection networks.

[39]

G. Cooperman and L. Finkelstein. Cayley graph techniques for permutation routing on bus interconnexion networks, 1994.

[40]

G. Cooperman, L. Finkelstein, and N. Sarawagi. Applications of Cayley graphs. In Appl. Algebra, Alg. Algo. and Error-Correcting Codes (AAECC-8, 1990), volume 508 of Lecture Notes in Comput. Sci., Springer Verlag, pages 367--378, 1991.

[41]

Stephen Curran and Joseph Gallian. Hamiltonian cycles and paths in Cayley graphs and digraphs - a survey. Discrete Mathematics, 156, 1996.

[42]

Khaled Day and Anand Tripathi. Arrangements graphs : a class of generalized star graphs. Inform. Process. Lett., 42:235--241, 1992.

[43]

Khaled Day and Anand Tripathi. A comparative study of topological properties of hypercubes and star graphs. IEEE Trans. Parallel Distrib. Systems, 5(1):31--38, 1994.

[44]

O. Delmas. Communications par commutation de circuits dans les réseaux d'interconnexion. PhD thesis, Université de Nice - Sophia Antipolis, Laboratoire I3S-CNRS URA 1376, 1997.

[45]

C. Delorme. Graphes et hypergraphes sommet-transitifs. Internal report 383, L. R. I., Orsay, France, 1987.

[46]

C. Delorme. Examples of products giving large graphs with given degree and diameter. Discrete Appl. Math., 37-38:157--167, 1992. Special issue on interconnection networks.

[47]

C. Delorme. Isomorphisms of transposition graphs. Technical Report 1101, L. R. I., Orsay, France, 1997.

[48]

Dominique Désérable. A family of Cayley graphs on the hexavalent grid. Discrete Appl. Math., 93:169--189, 1999.

[49]

Vassilis Dimakopoulos and Nikitas Dimopoulos. Total exchange in Cayley networks. Lecture Notes in Comput. Sci., Euro-Par96, 1123:341--346, 1996.

[50]

Michael J. Dinneen. Algebraic methods for efficient network construction. Master's thesis, University of Victoria, 1991.

[51]

Michael J. Dinneen and Paul R. Hafner. New results on the degree/diameter problem. Networks, 24:359--367, 1994.

[52]

W. Dörfler. Every regular graph is a quasigroup graph. Discrete Math., 10:181--183, 1974.

[53]

L.L. Doty, R.J. Goldstone, and C.L. Suffel. Cayley graphs with neighbor connectivity one. SIAM J. Discrete Math., 9(4):625--642, 1997.

[54]

R. N. Draper. An overview of supertoroidal networks. In 3rd ACM Symp. on Parallel Algorithms and Architectures, pages 95--102, 1991.

[55]

Dyi-Rong Duh, Gen-Huey Chen, and D. Frank Hsu. Combinatorial properties of generalized hypercube graphs. Inform. Process. Lett., 57:41--45, 1996.

[56]

Bernard Elspas and James Turner. Graphs with circulant adjacency matrices. J. of Combin. Th., 9:297--307, 1970.

[57]

M. Escudero, J. Fabrega, and P. Morillo. Fault tolerance routings in double-loop networks. Ars Combin., 25A:187--198, 1988.

[58]

S. Even and O. Goldreich. The minimal-length generating sequence problem is NP-hard. J. Algorithms, 2:311--313, 1981.

[59]

Ruskey F. and Savage C. Hamilton cycles that extend transposition matchings in Cayley graphs of S_n^*. SIAM J. Discrete Math., 6:152--166, 1993.

[60]

Vance Faber, James Moore, and William Y. C. Chen. Cycle prefix digraphs for symmetric interconnection networks. Networks, 23:641--649, 1993.

[61]

Xin Gui Fang, Cai Heng Li, and Cheryl Praeger. On orbital regular graphs and Frobenius graphs. Discrete Math., 182:85--99, 1998.

[62]

R. J. Faudree. Some strong variations of connectivity. In Combinatorics, Keszthely, volume 64(1), pages 125--144. Coll. Math. Soc. Janos Bolyai, 1993.

[63]

M. A. Fiol and E. Garriga. The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs. Discrete Appl. Math., 87:77--97, 1998.

[64]

M.A. Fiol, E. Garriga, and J.L.A. Yebra. On a class of polynomials and its relation with the spectra and diameters of graphs. J. Comb. Theory, Ser. B, 67:48--61, 1996.

[65]

M.A. Fiol and J.L.A. Yebra. Ciclos de hamilton en redes de pasos commutativos y de paso fijo. Stochastica, 12:113--129, 1988.

[66]

D. Fortin, C. Kirchner, and P. Strogova. Routing in regular networks using rewriting. In J. Slaney, editor, Proceedings of the CADE international workshop on automated reasoning in algebra (ARIA), pages 5--8, 1994.

[67]

J. Fournier. Le groupe d'automorphismes des graphes de Cayley engendrés par des transpositions. Master's thesis, Univ. de Montréal, Canada, 1997.

[68]

Paraskevi Fragopoulou. Communication and fault tolerance algorithms on a class of interconnection networks. PhD thesis, Queen'University, Kingston, Canada, 1995.

[69]

Paraskevi Fragopoulou and Selim G. Akl. Optimal communication algorithms on star graphs using spanning tree constructions. J. Parallel Distrib. Comput., 24:55--71, 1995.

[70]

Paraskevi Fragopoulou and Selim G. Akl. Optimal communication primitives on the generalized hypercube network. J. Parallel Distrib. Comput., 32(2):173--187, 1996.

[71]

Paraskevi Fragopoulou and Selim G. Akl. Spanning subgraphs with applications to communication on a subclass of the Cayley graph based networks. Discrete Appl. Math., 83:79--96, 1998.

[72]

Joel Friedman. On Cayley graphs on the symmetric group generated by transpositions. Combinatorica, 20:505--519, 2000.

[73]

E. Fuller and Balakrishnan Krishnamurthy. Symmetries in graphs : an annoted bibliography. Technical report CR 86-03, Computer Research Lab., Tektronics Laboratories, Beaverton, 1986.

[74]

Max Garzon. Cayley automata. Theoretic. Comput. Sci., 108:83--102, 1993.

[75]

W. H. Gates and C. H. Papadimitriou. Bounds for sorting by prefix reversal. Discrete Math., 27:47--57, 1979.

[76]

G. Gauyacq. Routages uniformes dans les graphes sommets-transitifs. Thèse, Université Bordeaux I, 1995.

[77]

A. Germa, M.-C. Heydemann, and D. Sotteau. Cycles in cube-connected cycles. Discrete Appl. Math., 83:135--155, 1998.

[78]

C. Godsil and G. Royle. Algebraic graph theory. Number 207 in Graduate texts in mathematics. Springer, 2001.

[79]

C. D. Godsil. Connectivity of minimal Cayley graphs. Arch. Math., 37:473--476, 1981.

[80]

D. M. Gordon. Parallel sorting in Cayley graphs. Algorithmetica, 6:554--564, 1991.

[81]

C. GowriSankaran. Broadcasting on recursively decomposable Cayley graphs. Discrete Appl. Math., 53:171--182, 1994.

[82]

R. Graham, M. Grötschel, and L. Lovász, editors. Handbook of Combinatorics. Elsevier Science B.V., 1995.

[83]

Qian-Ping Gu and Shietung Peng. Fault tolerant routing in hypercubes and star graphs. Parallel Process. Lett., 6:127--136, 1996.

[84]

Y. O. Hamidoune, A. S. Lladó, O. Serra, and R. Tindell. On isoperimetric connectivity in vertex-transitive graphs. SIAM J. on discrete Math., 13:139--144, 2000.

[85]

Y.O. Hamidoune. Sur quelques problèmes de connexité dans les graphes orientés. J. Combin. Theory Ser. B, 30:1--10, 1981.

[86]

Y.O. Hamidoune, A.S. Lladó, and O. Serra. Vosperian and superconnected Abelian Cayley digraphs. Graphs Combin., 7:143--152, 1991.

[87]

Y.O. Hamidoune, A.S. Lladó, and O. Serra. The connectivity of hierarchical digraphs. Discrete Appl. Math., 37-38:275--280, 1992.

[88]

Y.O. Hamidoune, A.S. Lladó, and O. Serra. Small cutsets in quasiminimal Cayley graphs. Discrete Math., 159:131--142, 1996.

[89]

Y.O. Hamidoune, A.S. Lladó, and O. Serra. An isoperimetric problem in Cayley graphs. Theory Comput. Syst., 32:507--51, 1999.

[90]

Mohammad Heydari and Hal Sudborough. On sorting by prefix reversals and the diameter of pancake networks. Lecture Notes in Comput. Sci., 678:218--227, 1993.

[91]

Marie-Claude Heydemann and Bertrand Ducourthial. Cayley graphs and interconnection networks, pages 167--224. Number 497 in NATO ASI, series C: Math. Phys. Sci. Kluwer Academic Publishers, 1997.

[92]

Marie-Claude Heydemann, Nausica Marlin, and Stephane Perennes. Cayley graphs with complete rotations, 2001.

[93]

Ching-Tien Ho and Ming-Yang Kao. Optimal broadcast in all-port wormhole-routed hypercubes. IEEE Trans. Parallel Distrib. Systems, 6:200--204, 1995.

[94]

A.J. Hoffman and R.R. Singleton. On moore graphs with diameters 2 and 3. IBM J. Res. Develop., 4:497--504, 1960.

[95]

D. Franck Hsu. Introduction to a special issue on interconnection networks. Networks, 23:211--213, 1993.

[96]

D. Franck Hsu. On container width and length in graphs, groups and networks. IEICE Trans. Fundamentals, E77(A):668--680, 1994.

[97]

Jen-peng Huang, S. Lakshmivarahan, and S. K. Dhall. Analysis of interconnection networks based on Cayley graphs of strong generating sets. In Proc. Int. Conf. Parallel Process., pages 42--45, 1994.

[98]

Leendert Huisman and Sandip Kundu. Highly reliable symmetric networks. IEEE Trans. Parallel Distrib. Systems, 5:94--97, 1994.

[99]

W. Imrich. Graphs with transitive abelian automorphisms groups. In Combinatorial Theory and its Applications, pages 651--656, 1970.

[100]

Yoshiyasu Ishigami. Graphs with transitive abelian automorphisms groups. Networks, 27:257--266, 1996.

[101]

M. Jerrum. The complexity of finding minimum-length generator sequence. Theor. Comput. Sci, 36:265--289, 1985.

[102]

Xing-De Jia. Cayley digraphs of finite cyclic groups with minimal average distance. In Proceedings of a DIMACS workshop held Feb. 7-9, 1994 at Rutgers University, number 21 in DIMACS, Ser. Discrete Math. Theor. Comput. Sci, pages 229--250. American Mathematical Society, 1995.

[103]

Xing-De Jia. Extremal Cayley digraphs of finite cyclic groups. Siam J. Discrete Math., 8:62--75, 1995.

[104]

Z. Jovanovic and J. Misic. Fault tolerance of the star graph interconnection network. Inform. Process. Lett., 49:145--150, 1994.

[105]

J. Jwo, S. Lakshmivarahan, and S. K. Dhall. A new class of interconnection networks based on the alternating group. Networks, 23:315--326, 1993.

[106]

Evangelos Kranakis and Danny Krizanc. Distributed computing on Cayley networks. In Proc. 4th IEEE Symp. Parallel Distribut. Process., pages 222--229, 1992.

[107]

Evangelos Kranakis and Danny Krizanc. Labeled versus unlabeled distributed Cayley networks. Discrete Appl. Math., 63:223--236, 1995.

[108]

Priyalal Kulasinghe and Said Bettayeb. Edge disjoint paths in Cayley color graphs. Research report, Louisiana State University, 1993.

[109]

Priyalal Kulasinghe and Said Bettayeb. On the multiply-twisted hypercube. In Parallel and Distributed Computing, volume 805 of Lecture Notes in Comput. Sci., pages 267--278. First Canada-France Conf., Montreal, 1994.

[110]

S. Lakshmivarahan, J. Jwo, and S. K. Dhall. Symmetry in interconnection networks based on Cayley graphs of permutation groups: a survey. Parallel Comput., 19:361--407, 1993.

[111]

Benoît Larose, Francois Laviolette, and Claude Tardif. On normal Cayley graphs and hom-idempotent graphs. Eur. J. Comb., 7:867--881, 1998.

[112]

Shahram Latifi. On the fault diameter of the star graph. Inform. Process. Lett., 46:143--150, 1993.

[113]

Christian Lavault. Interconnection networks: graph and group-theoretic modelling. Preprint lipn, LIPN Villetaneuse, France, 1994.

[114]

C. Le Conte de Poly-Barbut. Sur les treillis de Coxeter finis. Math. Inf. Sci. Hum., 125:41--57, 1994.

[115]

Claude Le Conte de Poly-Barbut. Treillis de Cayley des groupes de Coxeter finis. Constructions par récurrence et décompositions sur des quotients. Math. Inf. Sci. Hum., 140:11--33, 1997.

[116]

Cai Heng Li. Isomorphisms of connected Cayley digraphs. Graphs Comb., 14:37--44, 1998.

[117]

Cai Heng Li. On isomorphisms of connected Cayley graphs II. J. Comb. Theory, Ser. B, 74:28--34, 1998.

[118]

Cai Heng Li. On isomorphisms of connected Cayley graphs. III. Bull. Aust. Math. Soc., 58:137--145, 1998.

[119]

Cai Heng Li. Isomorphisms of finite Cayley digraphs of bounded valency. II. J. Comb. Theory, Ser. A, 87:333--346, 1999.

[120]

Cai Heng Li and Cheryl E. Praeger. On the isomorphism problem for finite Cayley graphs of bounded valency. Eur. J. Comb., 20:279--292, 1999.

[121]

Juqiang Liu. Hamiltonian decomposition of Cayley graphs on abelian groups of odd order. J. Combin. Theory Ser. B, 66:75--76, 1996.

[122]

A.S. Lladó and O. Serra. Hamiltonian cycles in cayley digraphs with two generators. J. Combinatorics, Information and System Sciences, 15:271--280, 1990.

[123]

Laszlo Lovász. On the Shannon capacity of a graph. Trans. Inf. Theory, IT-25:1--7, 1979.

[124]

A. Machi and F. Mignosi. Garden of Eden configurations for cellular automata on Cayley graphs of groups. SIAM J. Discrete Math., 6:44--56, 1993.

[125]

W. Mader. Über den Zusammenhang symmetrischer Graphen. Arch. Math., 21:331--336, 1970.

[126]

W. Mader. Minimale n-fach kantenzusammenhängende Graphen. Math. Ann., 191:21--28, 1971.

[127]

Nausica Marlin. Rotations complètes dans les graphes de Cayley. Dea, Université de Nice Sophia-Antipolis, France, 1996.

[128]

Bojan Mohar. Some applications of Laplace eigenvalues of graphs. In Hahn Gena et al., editors, Graph symmetry: algebraic methods and applications. Proceedings of the NATO Advanced Study Institute and séminaire de mathématiques supérieures, Montreal, Canada, July 1-12, 1996., number 497 in NATO ASI Ser., Ser. C, Math. Phys. Sci., pages 225--275. Dordrecht: Kluwer Academic Publishers., 1997.

[129]

Joy Morris. Connectivity of Cayley graphs: A special family. J. Combin. Math. Combin. Comput., 20:111--120, 1996.

[130]

C. Padro and Paz Morillo. The diameter vulnerability of iterated line digraphs. Discrete Math., 149:189--204, 1996.

[131]

Subburajan Ponnuswamy and Vipin Chaudhary. A comparative study of star graphs and rotator graphs. In Int. Conf. on Parallel Processing, pages 46--50, 1994.

[132]

Y.R. Potlapalli. Trend in interconnection networks topologies. In Int. Conf. on Parallel Processing Workshop, pages 24--29, 1995.

[133]

Franco P. Preparata and Jean Vuillemin. The cube-connected cycles : a versatile network for parallel computation. Communications of the ACM, 24:300--309, 1981.

[134]

Ronald C. Read and Robin J. Wilson. An atlas of graphs. Oxford Science Publications. Oxford: Clarendon Press, 1998.

[135]

Zsuzanna Róka. Automates cellulaires sur graphes de Cayley. PhD thesis, Ecole Normale Supérieure de Lyon, Lyon, France, 1994.

[136]

Zsuzanna Róka. One-way cellular automata on Cayley graphs. Theoret. Comput. Science, 132:259--290, 1994.

[137]

Joseph J. Rotman. An introduction to the theory of groups. 4th ed. Number 148 in Graduate Texts in Mathematics. Springer-Verlag, 1995.

[138]

Yordan Rouskov, Shahram Latifi, and Pradip K. Srimani. Conditional fault diameter of star graph networks. J. Parall. Dist. Comput., 33:91--97, 1996.

[139]

Yordan Rouskov and Pradip K. Srimani. Fault diameter of star graphs. Inform. Process. Lett., 48:243--251, 1993.

[140]

Y. Saad and M. H. Schultz. Topological properties of hypercubes. IEEE Trans. Comput., 37(7):867--872, 1988.

[141]

Gert Sabidussi. On a class of fixed-point-free graphs. Proc. Amer. Math. Soc., 9:800--804, 1958.

[142]

Gert Sabidussi. Graph multiplication. Math. Zeitschr., 72:446--457, 1960.

[143]

Gert Sabidussi. The lexicographic product of graphs. Duke Math. J., 28:573--578, 1961.

[144]

Gert Sabidussi. Vertex transitive graphs. Monatshefte für Mathematik, 68:426--438, 1964.

[145]

Michael Sampels. Algebraic constructions of efficient systolic architectures. In Proceedings of the 2nd International Conference on Massively Parallel Computing Systems (MPCS '96). IEEE, 1996.

[146]

Michael Sampels. Algebraische Konstruktion effizienter Verbindungsnetzwerke. PhD thesis, Fachbereich Informatik der Carl von Ossietzky Universitat Oldenburg, Oldenburg, Allemagne, 1996.

[147]

Michael Sampels. Cayley graphs as interconnection networks: A case study. In Proceedings of the 7th International Workshop on Parallel Processing by Cellular Automata and Arrays (PARCELLA '96), pages 67--76, Berlin, 1996. Akademie-Verlag.

[148]

Michael Sampels. Massively parallel architectures and systolic communication. In Proceedings of the 5th Euromicro Workshop on Parallel and Distributed Processing (PDP '97). IEEE/Euromicro, 1997.

[149]

Michael Sampels and Stefan Schöf. Massively parallel architectures for parallel discrete event simulation. In Proc. 8th European Simulation Symp. (ESS '96), volume 2, pages 374--378. SCS, 1996.

[150]

Stephen Schibell and Richard Stafford. Processor interconnection networks from Cayley graphs. Discrete Appl. Math., 40:333--357, 1992.

[151]

P. Strogova. Finding a finite group presentation using rewriting. In M. Bronstein, editor, Proceedings of the Workshop on symbolic rewriting techniques, pages 35--40, 1995.

[152]

P. Vadapelli and P.K. Srimani. Trivalent graphs for interconnection networks. Inform. Process. Lett., 54:329--335, 1995.

[153]

P. Vadapelli and P.K. Srimani. A new family of Cayley graph interconnection networks of constant degree four. IEEE Trans. Parallel Distrib. Systems, 7:26--32, 1996.

[154]

P. Vadapelli and P.K. Srimani. Shortest routings in trivalent Cayley graphs networks. Inform. Process. Lett., 57:183--188, 1996.

[155]

E. VanDoorn. Connectivities of circulant digraphs. J. Graph Theory, 10:9--14, 1986.

[156]

A. Vince. Graphs and finitely presented groups. Contemporary Mathematics, 89:167--185, 1989. Graphs and algorithms, Proc. Conf., Boulder/CO 1987.

[157]

Mark E. Watkins. Connectivity of transitive graphs. J. Combin. Theory, 8:23--29, 1970.

[158]

Mark E. Watkins. On the action of non-abelian groups on graphs. J. Combin. Theory, 11:95--104, 1971.