Heydemann, Marlin, P rennes: Rotations in Cayley Running Head: Rotations in Cayley Contact Author: Nausica Marlin Projet MASCO

Transcription

1 Article Submitted to European Journal of Combinatorics Complete Rotations in Cayley Graphs Marie-Claude Heydemann 1, Nausica Marlin and St phane P rennes 1 LRI, URA 410 CNRS, b t 490, Univ. Paris Sud, Orsay Cedex - France mch@lri.fr Projet Mascotte (INRIA-CNRS-UNSA), I3S, Univ. Nice - Sophia Antipolis, BP Sophia Antipolis Cedex - France Stephane.Perennes, Nausica.Marlin@inria.fr 1

2 Heydemann, Marlin, P rennes: Rotations in Cayley Running Head: Rotations in Cayley Contact Author: Nausica Marlin Nausica.Marlin@inria.fr Projet MASCOTTE (INRIA-CNRS-UNSA), I3S, Univ. Nice, BP Sophia Antipolis Cedex - France

3 Heydemann, Marlin, P rennes: Rotations in Cayley 3 Abstract As it is introduced by Bermond, P rennes, and Kodate and by Fragopoulou and Akl, some Cayley graphs, including most popular models for interconnection networks, admit a special automorphism, called complete rotation. Such an automorphism is often used to derive algorithms or properties of the underlying graph. For example, some optimal gossiping algorithms can be easily designed by using a complete rotation, and the constructions of the best known edge disjoint spanning trees in the toroidal meshes and the hypercubes are based on such an automorphism. Our purpose is to investigate such Cayley graphs. We relate some symmetries of a graph with potential algebraic symmetries appearing in its denition as a Cayley graph on a group.

4 1. Introduction Heydemann, Marlin, P rennes: Rotations in Cayley 1 Cayley graphs are good models for interconnection networks and have been intensively studied for this reason during the last few years. Articles [1], [17] and [13] give a survey. Bermond, Kodate and Perennes dene in [4] the concept of complete rotation in Cayley graphs in order to construct a gossip algorithm from a broadcast protocol applied to each vertex simultaneously. Given particular conditions on the orbits of the vertices under the complete rotation, they provide an optimal gossip algorithm. They build such an algorithm in the hypercube, the squared toroidal mesh and the star-graph (see the denitions in Appendix A). Fragopoulou and Akl consider in [10] and [11] a similar concept of rotation in Cayley graphs to construct a spanning subgraph used as a basic tool for the design of communication algorithms (gossiping, scattering). The class of graphs they consider contains most popular Cayley graphs for interconnection networks, such as cycles, hypercubes, generalized hypercubes, star graphs and the square n-dimensional torus. Hence Cayley graphs admitting a complete rotation have specic symmetry properties which enable ecient and simple algorithmic schemes. In this paper, we study this class of Cayley graphs and derive some of their properties. More precisely, we relate some symmetries of a graph with potential algebraic symmetries appearing in its denition as a Cayley graph on a group. The paper is organized as follows. In Section, after recalling some basic denitions and properties of Cayley graphs, we give the denitions and some properties of rotations and complete rotations. In Section 3, we study several conditions for the existence of a rotation. First, a characterization of graphs having a complete rotation is given in terms of representation and relators for the group and the set of generators (Section 3.1). Then, we introduce the rotationtranslation group of a Cayley graph and consider some necessary conditions of the rotational property (Section 3.3). In Section 3.4, we consider complete rotations on Cartesian products of graphs. Finally, Appendix A contains the denitions and drawings of some Cayley graphs and Appendix B summarizes the notation. In [14], a last part is devoted to the Cayley graphs dened by transpositions.. Preliminaries.1. Cayley graphs All groups considered are nite. By abuse of notation, we use the same letter to denote a group and the set of its elements and specify the operation of the group only when confusion can arise. We use multiplicative notation except in the case of Abelian groups. We denote by Z the additive group of integers, and by Z n the group of integers modulo n. For G a group and S G, the group generated by

5 Heydemann, Marlin, P rennes: Rotations in Cayley S is denoted by hsi. The automorphism group of G (set of one-to-one mappings from G to G which preserve the composition law) is denoted by Aut(G). A permutation on the set X = f1; ; ng is a one-to-one mapping from X to X. As usual, it is denoted by the images ((1); ; (n)). For a permutation on X, Supp is the set of elements i of X such that (i) 6= i. A product of permutations means that we apply rst mapping on the set f1; ; ng and then mapping, i.e., = (( (1)); ; ( (n))). We denote by S X the group of all permutations on X and, for short, by S n if X = f1 ng. A cycle such that (i 1 ) = i ; : : : (i k?1 ) = i k ; (i k ) = i 1 is denoted by hi 1 ; i ; : : : ; i k i. In particular, hi; ji denotes the transposition of elements i and j. We consider mainly simple undirected graphs. A graph? is dened by its vertex set V? and its edge set E?. The edge between two vertices u and v is denoted by [u; v] or simply by uv if no confusion is possible. If necessary, we consider the symmetric digraph? associated to a graph? and obtained by replacing any edge uv by two opposite arcs (u; v) and (v; u). We denote by A? the set of arcs of?. We denote by Aut(?) the automorphism group of a graph?. A graph? is said to be arc-transitive (symmetric in [5]) if for any given pair of directed edges (u; v); (u 0 ; v 0 ) there exists an automorphism f Aut(?) such that f (u) = u 0 and f (v) = v 0. In other words? is said to be arc-transitive if Aut(?) acts transitively on A?. Denition: (see for example [5]) Let G be a group with unit I and S a subset of G such that I = S and the inverse of elements of S belong to S. The Cayley graph Cay(G; S) is the graph with vertex set G and with edge set f[g; gs] : g G; s Sg. We say that the edge [g; gs], s S, is labeled by s. Notice that the edge [g; gs] can also be labeled by s?1 since it is equal to the edge [gs; gss?1 ]. Examples of well-known Cayley graphs are given in Appendix A. We recall some well known results on Cayley graphs we use later. If G is generated by S, i.e. G = hsi, then Cay(G; S) is connected. By analogy with geometry, for a G, the mapping t a : G! G, dened by t a (x) = ax, is called a translation of Cay(G; S). The mappings t a ; a G, form a subgroup T of Aut(Cay(G; S)) which is isomorphic to the group G and acts regularly on G. The following characterization of Cayley graphs is well-known. Theorem.1: [0] Let? be a connected graph. The automorphism group Aut(?) has a subgroup G which acts regularly on V? if and only if? is a Cayley graph Cay(G; S), for some set S generating G.

6 Heydemann, Marlin, P rennes: Rotations in Cayley 3.. S-stabilizers and rotations Let G be a group. Note that any internal mapping of G can be considered as an action on the vertices of the graph Cay(G; S). So some symmetries of the group G give naturally rise to symmetries in the graph Cay(G; S). For commodity, we introduce: Denition: Let G be a nite group and S a set of generators of G. A homomorphism! of the group G is called a S-stabilizer if!(s) = S. Notice that since G is nite, a S-stabilizer is bijective and therefore a group automorphism. We denote by Stab(G; S) the set of S-stabilizers of G which is a subgroup of Aut(G). A S-stabilizer dierent from the identity is said to be non-trivial. In the following, we study graph automorphisms of Cay(G; S) which are induced by S-stabilizers of G using the following proposition, a proof of which can be found in [5], Proposition 16.. Proposition.1: [3] If! is an automorphism of the group G generated by S such that!(s) = S, then! is a graph automorphism of Cay(G; S) which xes the vertex I. By proposition.1, a S-stabilizer induces a graph automorphism of Cay(G; S) we simply call a rotation. When applying Proposition.1, we use the same letter to denote the group automorphism and the graph automorphism it induces. If H is a subgroup of Stab(G; S), we denote by H its corresponding isomorphic subgroup of Aut(Cay(G; S)), or simply by H when no confusion can arise..3. Denitions of complete rotations The notion of rotation in graph theory was rst used in the context of embeddings (see for example [6], [4]). In this context, a rotation of a graph? at a vertex i is a cyclic ordering of the neighbours of i, and a rotation scheme is a collection fr i ; i V?g, where r i is a rotation at the vertex i. It is used to embed the graph? into a surface. For a Cayley graph, any cyclic permutation r of the generators allows us to dene a rotation scheme by r i (j) = ir(i?1 j) for any edge ij (see [6], page 117). The notion of complete rotation in Cayley graphs we use is related, but different. The original denition of complete rotation is given in [4] as follows: Denition: [4] Let Cay(G; S) be a Cayley graph with G = hsi. A mapping! : G! G is a complete rotation of Cay(G; S) if it is bijective and satises the following two properties for some ordering of S = fs i ; 0 i d? 1g: for any x G and any i Z d.!(i) = I (1)!(xs i ) =!(x)s i+1 ()

7 Heydemann, Marlin, P rennes: Rotations in Cayley 4 It is a particular case of the concept of rotation. As we see below, a complete rotation of Cay(G; S) is a rotation of Cay(G; S) such that the permutation induced on S is a cycle of length jsj. More precisely, let us rst consider the S-stabilizers of G which cyclically permutes the generators in S. Denition: A S-stabilizer of G,! : G! G, is said to be cyclic if, for some ordering of S = fs i ; 0 i d? 1g,!(s i ) = s i+1, for any i Z d. Then, we get: Proposition.: A mapping! : G! G is a complete rotation of Cay(G; S) if and only if it is the graph automorphism induced by a cyclic S-stabilizer of G. Proof: Clearly, any cyclic S-stabilizer of G induces a complete rotation of Cay(G; S) as dened in Denition.3. The converse is a corollary of the following proposition.3 listing some properties of complete rotations (some of them are used in [11] and [4]). Proposition.3: Let! be a complete rotation of the Cayley graph Cay(G; S), with G = hsi. Then, for some order of S = fs i ; 0 i d? 1g, the following properties are satised. (i) For any i Z d,!(s i ) = s i+1 ; (ii) For any i; j Z d and any x G,! j?i (xs i ) =! j?i (x)s j ; (iii)! is a group automorphism of order d; (iv)! is a graph automorphism; and (v)! p is a group automorphism for any p Z and a complete rotation for p prime with d. In particular,!?1 is a complete rotation. Proof: (i) By taking x = I in Equation () of Denition.3. (ii) By induction on j? i using Equation (). (iii) By induction on the number of factors of an element written as a product of generators, we get from denition.3, for any x; y G,!(xy) =!(x)!(y) Thus the bijective mapping! is a group automorphism. Furthermore, for any generator s i, by (ii),! d (s i ) = s i and! j (s i ) 6= s i for 0 j < d, so that! d = I and! k 6= I for 1 k < d. (iv) By Proposition.1 and (iii),! is a graph automorphism. (v) By induction on p, for any x; y G,! p (xy) =! p (x)! p (y). If p and d are co-prime then pz d = Z d and the sequence s 0 ; s p ; s p ; ; s (d?1)p denes a new ordering of the generators so that! p is a complete rotation.

8 Heydemann, Marlin, P rennes: Rotations in Cayley 5 The simplest automorphisms of a group G are inner automorphisms : x! x?1, where G. Therefore it is natural to consider the following property which denes the notion of rotation considered in [11]: Proposition.4: Let Cay(G; S) be a Cayley graph where G = hsi. If there exist an element G and an ordering of S = fs i ; 0 i d? 1g such that for any i Z d, s i+1 = s i?1 ; (3) then the mapping! : G! G, such that!(x) = x?1, is a complete rotation of Cay(G; S). Proof: An inner automorphism of G dened by!(x) = x?1 and satisfying Equation 3 is a cyclic S-stabilizer. By Property., it induces a complete rotation of Cay(G; S). In [11], the authors give the generators s i ; 0 i d? 1, and a permutation S n for cycles, hypercubes, square torus, star graphs, modied bubble-sort graphs, bisectional networks, and two generalizations of hypercubes, showing by Property.4 that all these graphs have a complete rotation (see Appendix A). Thus most of the popular Cayley graphs for interconnection networks have a complete rotation. Property.4 suggests the following problem. Problem 1: For which Cayley graphs Cay(G; S) is the existence of a complete rotation equivalent to the existence of an inner automorphism of G which cyclically permutes the generators in S? Considering Cayley graphs dened on transpositions, we give a partial answer to this problem in [14]. Notice that it is a classical result of group theory that if G = S n with n 6= ; 6, then the only group automorphisms of G are the inner automorphisms. But this result is not sucient since, for example, the hypercube H(d) is a Cayley graph on a proper subgroup of S d (see Appendix A)..4. Rotational graphs We say for short that a graph? is rotational if there exist a group G and a set of generators S such that? = Cay(G; S) and G has a cyclic S-stabilizer. Remark: The existence of a complete rotation in a given Cayley graph depends on the choice of the group and the set of generators as the following proposition and theorem show. Proposition.5: The additive group Z n has a cyclic Z n n f0g-stabilizer if and only if n is prime.

9 Heydemann, Marlin, P rennes: Rotations in Cayley 6 Proof: The additive group Z n is generated by Z n = Z n n f0g. For x Z, any group homomorphism! satises!(x) =!( ) = x!(1). Thus, if!(1) = a, then!(x) = ax. If! is a complete rotation, then the generators are 1; a; a ; a n? and thus Z n = f1; a; a ; a n? g is cyclic. Thus, n is prime. Conversely, if n is prime, there is an integer a such that Z n = f1; a; a ; a n? g and then!(x) = ax is a complete rotation. Thus Cay(Z n ; Z n ) has a complete rotation if and only if n is prime. On the other hand, we have the following result. Theorem.: The complete graph K n is rotational if and only if n is a power of a prime number. Proof: [18] First note that K n = Cay(G; S) if and only if the order of G is n and S = G n I. It means that every element of G except the identity is a generator. If n is not a prime power, then there exist two dierent prime numbers p and q which divide n. Then the group G has at least an element of order p and an element of order q with p 6= q. By Corollary 3., K n is not rotational. If n is a prime power, then there exists a eld F with n elements (see for example [], page 445) and F n f0g is a cyclic multiplicative group. For any generator r of F n f0g, the mapping!, dened by!(x) = rx, is a complete rotation of K n = Cay(F; F n f0g) (F is considered as an additive group). Notice that a similar result has already been proved in the context of maps, in a dierent way ([6], page 18). Theorem.3: [6] There is a rotation on K n which gives rise to a symmetrical map if and only if n is a prime power. The next proposition shows that one can construct new rotational Cayley graphs by taking a quotient according to a normal subgroup which is invariant by the rotation. Proposition.6: If Cay(G; S) has a complete rotation which is a K-stabilizer for a normal subgroup K of G, then the quotient Cayley graph Cay(G=K; S 0 ) is also rotational, where S 0 is the image of S by the canonical epimorphism from G onto G=K. Proof: Let! be a complete rotation of Cay(G; S) such that!(k) = K. Since K is stabilized by!, we can dene the automorphism of G=K induced by! denoted by! 0. Let S 0 be the set of the images of S in G=K by the canonical epimorphism. Then! 0 is a group-automorphism of G=K which is also a graphautomorphism of Cay(G=K; S 0 ). Furthermore,! 0 induces a cyclic permutation of the generators. Thus! 0 is a complete rotation of Cay(G=K; S 0 ).

10 Heydemann, Marlin, P rennes: Rotations in Cayley 7 Example 1: Let K be a cyclic binary code (that is a subgroup of Z n invariant by cyclic shift of the coordinates). Then the graph (also called quotient) obtained from the hypercube H(n) by identifying all the vertices fx + k : k Kg to one vertex, for every x Z n, is a rotational Cayley graph. Proof: The hypercube H(n), considered as a Cayley graph on the additive group Z n, admits the cyclic shift of the coordinates as a complete rotation (see Appendix A.3 and Example 3). By denition a binary cyclic code K is a subgroup of Z n invariant by the cyclic shift and K is a normal subgroup since Z n is Abelian. By Proposition.6, Cay(Z n =K; S 0 ) is a rotational Cayley graph. Example : Kn del graph. The Kn del graphs are dened in [1] and are based on the Kn del construction of an optimal gossiping algorithm [16]. They can also be dened as Cayley graphs on the semi-direct product G = Z p o Z for the multiplicative law: and (x; y)(x 0 ; y 0 ) = (x + (?1) y x 0 ; y + y 0 ); x; x 0 Z p ; y; y 0 Z : S = f( i ; 1); 0 i d? 1g: We consider here the particular case p = n? 1 and S = fs i ; 0 i n? 1g, with s i = ( i ; 1). Let us consider the mapping! dened by![(x; y)] = (x; y). Since (x; y)s i = (x + (?1) y i ; y + 1), for 0 i n? 1, we get:!(0; 0) = (0; 0)![(x; y)s i ] =![(x; y)]s i+1 : By Denition.3,! is a complete rotation of Cay(Z p o Z ; S). 3. Study of conditions for the existence of a rotation 3.1. A characterization of rotations An attractive way to dene a group generated by a set S is to consider the elements of the group as words on the alphabet S modulo some well chosen set of equalities satised by the set S. For example, the additive group Z n Z n is generated by (1; 0) and (0; 1). Notice that (1; 0) + (0; 1) = (0; 1) + (1; 0), and n(0; 1) = n(1; 0) = (0; 0). This group can also be dened as a multiplicative group generated by S = fs 1 ; s g satisfying the equalities (called relations in group theory): s n 1 = I; sn = I and s 1s = s s 1 or s 1 s s?1 1 s?1 = I. Equivalently, in order to dene the group, one can use a set of relators R = fs 1 s s?1 1 s?1 ; s n 1; s n g. In the above example the mapping (x; y)! (y; x) belongs to Stab(G; S) and this fact clearly appears in the set of relations which is symmetric in s 1 and s. More precisely any group G generated by a set S can be seen as the quotient of the free group generated by S by a set of relations between the generators (see

11 Heydemann, Marlin, P rennes: Rotations in Cayley 8 for example [7], [15] or [19]) for the denitions on presentations of groups). As in [15], we denote by F (S) the free group generated by S and by R the subset of F (S) of the elements which are called relators (thus consisting of words on the elements of S). Let N(R) be the normal closure of R in F (S), that is the smallest normal subgroup of F (S) containing R. It is also the subgroup of F (S) generated by the elements grg?1, g F (S); r R (see for example [19], page 16). Then G is the quotient group F (S)=N(R). We denote by the canonical epimorphism from F (S) onto G and by e the empty word of F (S). Thus (e) = I and, for any x F (S), (x) = I if and only if x N(R). As usual, we do not distinguish s from (s) for s S. Recall also that any free group automorphism of F (S) can be dened by the images of the elements of S. Denition: For any S-stabilizer f of a group G with presentation G = (SjR), we denote by ~ f the automorphism of F (S) dened by ~ f (s) = f (s), for any s S. The following proposition shows the relation between a non-trivial group Stab(G; S) and a presentation of G with a set of relators admitting symmetries. Proposition 3.1: Let G be a group generated by a subset S. Then the following properties are equivalent: (i) the group G admits a non trivial S-stabilizer, i.e. the subgroup Stab(G; S) is non trivial; (ii) for any subset R of F (S) such that G = (SjR) is a presentation of G, the free group F (S) has a non trivial N(R)-stabilizer, where N(R) is the normal closure of R, which is also a S-stabilizer; and (iii) there exists a presentation of G, G = (SjR), such that F (S) has a non trivial R-stabilizer which is also a S-stabilizer. Remark: In other words the existence of a S-stabilizer is equivalent to the existence of a permutation on the set of generators S letting the set of relators R invariant. Proof: (i)) (ii) Assume f is an S-stabilizer of the group G generated by S. Then for any presentation G = (SjR), let us dene a group automorphism f ~ of F (S), as explained above, by f ~ (s) = f (s), for any s S. This implies f ~ = f. Furthermore, if x N(R), then (x) = I and f ((x)) = I = ( f ~ (x)), and thus ~f(x) N(R). This proves that f ~ is a N(R)-stabilizer. It is also a non-trivial S-stabilizer. (ii)) (iii) Evident by taking the canonical presentation G = (SjN(R)). (iii)) (i) Let G = (SjR) be a presentation of G and f ~ a R-stabilizer. Since every element x of N(R) is a product of elements of the form grg?1 with r R, g F (S) and f ~ is a R-stabilizer, using f ~ (grg?1 ) = f ~ (g) f(r) ~ f(g) ~?1 = g 0 r 0 g 0?1 with r 0 R, g 0 F (S), we get that f ~ is also a N(R)-stabilizer. Therefore it

12 Heydemann, Marlin, P rennes: Rotations in Cayley 9 is possible to dene a group automorphism f of the quotient F (S)=N(R) such that ~ f = f. Furthermore S is invariant by f. Corollary 3.1: Let G be a group generated by a subset S. Then the following properties are equivalent: (i) the Cayley graph Cay(G; S) has a complete rotation; (ii) for any presentation G = (SjR), the free group F (S) has a N(R)-stabilizer, where N(R) is the normal closure of R, which induces a cyclic permutation of S; and (iii) there exists a presentation of G, G = (SjR), such that F (S) has a R- stabilizer which induces a cyclic permutation of S. Proof: The proof is similar to the proof of Proposition 3.1 using the denition of a complete rotation and the fact that the action of f on S is the same as the action of ~ f. Remark: Once again the existence of a complete rotation of Cay(G; S) is equivalent to the existence of a presentation of G = (SjR) such that the set of relators R is invariant by a cyclic permutation of the generators. Corollary 3.: If Cay(G; S) has a complete rotation, then all the generators in S have the same order. Proof: This result is a consequence of Corollary 3.1 since, if the generator s i is of order p, the relation (s i ) p = I has to be xed by a cyclic permutation on the generators. The following table gives presentations (SjR) for some well known Cayley graphs Cay(G; S) with G = (SjR). These presentations are already known (see for example [7] and [8]). By applying Corollary 3.1, this proves that the considered graphs are rotational (see [11] and Appendix A for another proof using Property.4). Example 3: Graph S R Hypercube H(n) fs 1 ; s ; : : : ; s n g fs i ; s i s j s?1 Squared toroidal mesh fs 1 ; s ; : : : ; s d fs p ; s i is j s?1 T M d p s?1 1 ; s?1 ; : : : ; s?1 d i s?1 j i s?1 j Modied bubble-sort graph fs 1 ; s ; : : : ; s n g fs i ; (s i :s i+1 ) 3 ; s i s j s?1 i s?1 j MBS(n) (j 6= i + 1, j 6= i? 1) s n s 1 s : : : s n? s n?1 s n? : : : s s 1 g Star graph ST(n) fs 1 ; s ; : : : ; s n?1 g fs i ; (s i s j ) 3 ; (s i s j s k s j ) g g g

13 Heydemann, Marlin, P rennes: Rotations in Cayley 10 Let us notice that despite we only work here on graphs the same notion of complete rotation can be considered for digraphs. In that case, the generating set S do not need to be symmetric (S = S?1 ). With this denition similar result can be derived. In particular Corollary 3.1 can be applied to digraphs. For example, the digraphs dened as arrowheads in [9] have a complete rotation since they can be dened as the Cayley digraphs on the groups G n = (SjR n ) with S = fs 1 ; s ; s 3 g and R n = fs 1 s s 3 ; s 1 s s?1 1 s?1 ; s s 3 s?1 s?1 3 ; s 3 s 1 s?1 3 s?1 1 ; s n 1 ; s n ; s n 3 g for any n 0. In Proposition 3.1 and Corollary 3.1 a symmetric presentation of G is provided when the associated Cayley graph admits a rotation. One can think about asking the following question : if Cay(G; S) is rotational, is it possible to nd a symmetric presentation which is also minimal with respect to the inclusion? For example, in the case of arrowheads the presentation of G n given in [9] is minimal but not symmetric: (SjR 0 ), with n R0 n = fs 1s s 3 ; s 1 s s?1 1 s?1 ; s n 1 ; s n ; s n 3 g. 3.. Abelian groups One can give more details in the case of Cayley graphs on Abelian groups. Let us recall that a circulant graph (also called multi-loop graph) is a Cayley graph Cay(Z n ; S) on the additive group Z n with symmetric generating set S = fs 1 ; s ; : : : ; s k g, for some integers n; s 1 ; s ; : : : ; s k. These graphs have been intensively studied as models of interconnection networks (see the survey given in [3]). Lemma 3.1: A circulant graph Cay(Z n ; S) has a complete rotation if and only if there exists integers a and p prime with n such that S = fap : Ng. Proof: The if part is evident by taking!(x) = px. The only if part follows from the fact that every automorphism of the additive group Z n is of the kind x! px for some integer p (see the proof of Proposition.5). Lemma 3.: Let! : Z n! Z n be dened by!(x 1 ; ; x n ) = (x ; ; x n ; x 1 ). A Cayley graph on a (nite) Abelian group G has a complete rotation if there exists an integer n and a subgroup Q of Z n such that!(q) = Q and G is isomorphic to the quotient Z n =Q. Proof: By Corollary 3.1, we get the result. Example 1 is also an illustration of this lemma Rotation-translation group We consider some properties of Cayley graphs and compare them to the rotational property.

14 Heydemann, Marlin, P rennes: Rotations in Cayley 11 Proposition 3.: Given? = Cay(G; S), let H be a subgroup of Stab(G; S) and H be the induced subgroup of Aut(?). Let T be the subgroup of translations of?. Then the subgroup of Aut(?) generated by T and H, < H; T >, is a semi-direct product T o H and therefore has cardinal jgjjhj. Moreover, the set A h = fth j t T g for h H, acts regularly on the vertices of? and maps any arc labeled s on any arc labeled h(s). Proof: Let us recall conditions which are sucient to have a (inner) semi-direct product H nt = T oh ([19], page 7) : (i) T is a normal subgroup of < H; T >, (ii) < H; T >= T H, (iii) T \ H = I. We prove that all these conditions are fullled. (i) Let h be a S-stabilizer and t a a translation. For any x G, we get ht a (x) = h(ax) = h(a)h(x) = t h(a) h(x) = t h(a) h(x). Thus ht a = t h(a) h and T is a normal subgroup of < H; T >. (ii) Every element of < H; T > is a product of elements of H and T and using equality of (i) can be written as a product of T H or HT. (iii) If t a T belongs to H, then t a (I) = ai = I, thus a = I and t a = I. We now prove that, for any given h H, A h = fth j t T g acts regularly on the vertices. Let x and x 0 be two given vertices of?. x 0 = t a h(x) implies a = x 0 h(x)?1 and x 0 = t x 0 h(x)?1(x). Thus there exists a unique automorphism t ah A h such that x 0 = t a h(x). Furthermore, if y = xs, then t a h(y) = t a (h(x)h(s)) = ah(x)h(s) = t a (h(x))h(s) = t a h(x)h(s). Thus, if (x; y) is an arc labeled s, then (t a h(x); t a h(y)) is an arc labeled h(s). This achieves the proof. By taking H = Stab(G; S) in Proposition 3., we can introduce the following denition : Denition: Let? = Cay(G; S). The subgroup of automorphisms of? dened by the (inner) semi-direct product T o Stab(G; S) is called the rotation-translation group of?. In the case of complete rotation we obtain the following result. Corollary 3.3: For any rotational Cayley graph?, there exists a subgroup of Aut(?) which acts regularly on A? and is isomorphic to the semi-direct product T o Z d, where d is the degree and T is the translation group of?. Proof: Let! be a complete rotation of Cay(G; S). We apply Proposition 3. when H is the cyclic group <! > which is isomorphic to Z d. Let x; y; x 0 ; y 0 be vertices of? such that y = xs and y 0 = x 0 s 0, with s; s 0 S. Since! is a complete rotation there exists an integer i Z n such that! i (s) = s 0. By applying Proposition 3. with h =! i, we obtain an automorphism f = t a! i A h such that f (x) = x 0 and f (y) = f (xs) = x 0! i (s) = x 0 s 0 = y 0. Furthermore f is unique, for if y 0 = t a! i (y) and x 0 = t a! i (x), then t a! i (x)s 0 = y 0 = t a! i (x)! i (s), thus s 0 =! i (s). Since! is a complete rotation, i is unique in Z d. By Proposition 3., a is also unique.

15 Heydemann, Marlin, P rennes: Rotations in Cayley 1 For the hypercube H(d), the subgroup of Corollary 3.3 is (Z ) d o Z d. Let us notice that the buttery graph and the cube-connected cycles graph (see for example their denitions in [13]) are two Cayley graphs dened on this group. Corollary 3.4: Any rotational Cayley graph is arc-transitive. Notice that, in particular, the pancake graph, the cube-connected cycles graph and the buttery graph are not rotational since they are not arc-transitive (see [17]). Let us recall that the edge-connectivity of a vertex-transitive graph (in particular a Cayley graph) is maximal and that the vertex-connectivity of an edgetransitive Cayley graph is equal to its degree and therefore maximal []. By Corollary 3.4, we get the next result. Corollary 3.5: The vertex-connectivity of a rotational Cayley graph is maximal. Remark: Since K n is arc-transitive, Proposition.5 shows that not every arctransitive Cayley graph is rotational. We also show in [14] that the complete transposition graph which is arc-transitive ([17]) is not rotational. By Corollary 3., if Cay(G; S) has a complete rotation, then all generators of S have the same order in the nite group G. This condition is not sucient to insure the existence of a complete rotation. Remark: [18] There exist non-rotational Cayley graphs Cay(G; S) such that all generators of S have the same order in the group G. The M bius graph (depicted on Figure 1) is an example of such a graph Figure 1: M bius graph

16 Heydemann, Marlin, P rennes: Rotations in Cayley 13 The M bius graph can be dened as the circulant Cayley graph Cay(G; S) with G = Z 8 and S = f?1; +1; +4g (?4 +4 mod 8). The generators are of orders 8, 8 and, respectively. By Corollary 3., 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 (0; 1; 5; 4), but the edge 04 belongs to two 4-cycles (0; 1; 5; 4) and (0; 4; 3; 7). Thus by Corollary 3.4, this graph is not rotational. Since the M bius graph is isomorphic to Cay(G 0 ; S 0 ) with G 0 = (S 0 jr 0 ), S 0 = fx; y; zg and R 0 = fxyxyz?1 ; x ; y ; z g, this graph is an example of non rotational Cayley graph with all the generators of S 0 having the same order in G Complete rotations on Cartesian products The Cartesian product of two graphs? and? 0, denoted by?? 0, is the graph with vertex set V?V? 0 and edge set f[(i; j); (k; j)]; [i; k] E?g[f[(i; j); (i; l)]; [j; l] E? 0 g. We recall the following well known result. Proposition 3.3: If? = Cay(G; S) and? 0 = Cay(G 0 ; S 0 ), then?? 0 is the Cayley graph on the group G G 0 with set of generators (S I) [ (I S 0 ). In [11] the following question is settled. If? and? 0 are two graphs having a (complete) rotation, how about the Cartesian product?? 0? Proposition 3.4: (also found independently by D. Barth) Let? = Cay(G; S) be a Cayley graph with a complete rotation. Then the Cartesian product? n =??? also has a complete rotation with the induced Cayley structure. Proof: Assume! is a complete rotation of?. We denote the vertices of? n by (x 0 ; x 1 ; ; x n?1 ). The nd generators of? n can be ordered as t jn+i = (I; I; : : : ; s j ; : : : I; : : : ; I) (where i symbols I precede s j ), for 0 i n? 1 and 0 j d? 1. A complete rotation on? n is given by (x 0 ; x 1 ; ; x n?1 ) = (!(x n?1 ); x 0 ; ; x n? ): Now is a group homomorphism since [(x 0 ; x 1 ; x n?1 )(y 0 ; y 1 ; ; y n?1 )] = (x 0 y 0 ; x 1 y 1 ; ; x n?1 y n?1 ) = (!(x n?1 y n?1 ); x 0 y 0 ; ; x n? y n? ) = (!(x n?1 )!(y n?1 ); x 0 y 0 ; ; x n? y n? ) = (x 0 ; x 1 ; ; x n?1 )(y 0 ; y 1 ; ; y n?1 ): Furthermore, (t i ) = t i+1 for 0 i dn? 1 (t nd = t 0 ).

17 Heydemann, Marlin, P rennes: Rotations in Cayley 14 Notice that one can derive the same result by using Corollary 3.1 and considering a presentation G = (SjR) such that R is invariant by a cyclic permutation of S. Then one obtains a presentation (S 0 jr 0 ) of the Cartesian product by taking n disjoint copies of this presentation (S 1 jr 1 ); (S jr ); : : : ; (S n jr n ), with S j = fs j i; 1 i dg and 1 j n. The mapping! dened by!(s j i ) = sj+1 i for 1 j < n and!(s n i ) = s1 i+1 is a cyclic permutation of S 0 = [S j which is a R 0 -stabilizer. Denition: A graph? is said to be prime if there exist no non-trivial graphs and 0 such that? is isomorphic to 0. Two graphs? and? 0 are said to be relatively prime if there exist no non-trivial graph H, and graphs and 0, such that? is isomorphic to H and? 0 is isomorphic to H 0. Lemma 3.3: If and 0 are two relatively prime graphs, then 0 is not arctransitive, and thus not rotational. Proof: Applying the result of Sabidussi ([1]) to relatively prime and 0, we get Aut( 0 ) = Aut() Aut( 0 ): (4) Consider an arc [(x; y); (x 0 ; y)] of 0 (where x 6= x 0 and [x; x 0 ] is an arc of ). Its image by any graph automorphism of 0 is [(h(x); g(y)); (h(x 0 ); g(y))] where h Aut() and g Aut( 0 ). This image can never be an arc [(z; t); (z; t 0 )] (with t 6= t 0 and [t; t 0 ] an arc in 0 ). This proves that 0 is not arc-transitive and by Corollary 3.4 not rotational. Thus we get, Corollary 3.6: If? is a rotational Cayley graph, then there exists a prime graph and an integer n 1 such that? = n. Corollary 3.6 shows that if a Cayley graph is rotational and is a Cartesian product, then all its prime factors are isomorphic. But we do not know at the present time if these factors are rotational and even Cayley graphs. Thus we can formulate the following problem. Problem : If the graph? = n is rotational, is also (i) a Cayley graph? (ii) a rotational graph? Notice that, as far as we know, it is even not evident that if n is a Cayley graph, then is also a Cayley graph.

18 4. Conclusion Heydemann, Marlin, P rennes: Rotations in Cayley 15 In this article we have studied some Cayley graphs Cay(G; S) which are interesting as models of interconnection networks, since they behave well for communication algorithms. They have particular automorphisms called rotations which are induced by automorphisms of the group G dening the structure of Cayley graph. Such a group automorphism leaves invariant the set of generators S and in the particular case of a complete rotation cyclically permutes the generators. Not all Cayley graphs have such complete rotations and we have studied some characterizations. We have characterized the complete graphs which have a complete rotation. Our more general characterization is given in terms of representation and relators for the group and the set of generators, but this result is not easy to handle for a general graph. Nevertheless we completely characterized Cayley graphs generated by transpositions which have a complete rotation in [14]. We have also studied conditions for the existence of a rotation and proved that some necessary conditions are not sucient. Conversely, we do not know if some sucient conditions we give, like for Cartesian products, are also necessary. Thus, we have pointed some problems, the most exciting being probably the equivalence of the existence of a complete rotation! on Cay(G; S) and the existence of an inner group automorphism of G, x! x?1, which cyclically permutes the generators. Acknowledgements The authors thank Dominique Barth, Charles Delorme and Gert Sabidussi for helpful discussions and references. This work has its origin in part in discussions the authors have had at the NATO ASI on Graph Symmetry in Montreal, They also wish to express their thanks to the organizers of that meeting.

19 Heydemann, Marlin, P rennes: Rotations in Cayley A. Denitions of some Cayley graphs In this section we recall the denition of some classical Cayley graphs dened on permutation groups which are rotational (see also [11]). A.1. Cycle The cycle C n is the Cayley graph on S n and the subset of the two cycles h1; ; : : : ; ni and hn; n? 1; : : : ; 1i. In this case a complete rotation! is dened by!(x) = x?1, where the permutation is given by (n; n? 1; : : : ; ; 1). A.. Multidimensional torus The multidimensional torus T M d p is the Cartesian product of d cycles of length p and therefore T M d p is rotational by Proposition 3.4. A.3. Hypercube The hypercube H(d) is the graph with vertex set fx 1 x : : : x d : x i f0; 1gg, two vertices x 1 x : : : x d and y 1 y : : : y d being adjacent if and only x i = y i for all but one i. H(d) is the Cartesian product of d complete graphs K and the Cayley graph of the additive product group Z d generated by the d generators 0 : : : : : : 0, {z } i {z } d?i?1 0 i d? 1. H(d) is also the Cayley graph of the permutation group G generated by the d transpositions hi? 1; ii, 1 i d, dened on the set of d elements X = f1 : : : dg (H(4) is shown in Figure 3 and the associated transposition graph in Figure ). Indeed, each vertex x 1 x : : : x d, x i f0; 1g, can be renamed as the permutation (a 1 ; a ; : : : ; a d ) where (a i?1 ; a i ) = (i? 1; i) if x i = 0 and (a i?1 ; a i ) = (i; i? 1) if x i = 1. H(d) is rotational. A complete rotation! is dened on H(d) by!(x) = x?1, where is the permutation given by = (3; 4; : : : ; d? 1; d; 1; ) = h1; 3; : : : ; d? 1ih; 4; : : : ; di. Thus,?1 = (d?1; d; 1; ; : : : ; d?3; d?) and i h1; i?i = hi+1; i+i. i Figure : Transposition graph for H(4)

20 Heydemann, Marlin, P rennes: Rotations in Cayley ii <5,6> <3,4> <7,8> <1,> Figure 3: H(4) A.4. Star graph The star graph ST (n) is dened as the Cayley graph of the group S n generated by the n? 1 transpositions S = fh1; ii; 1 < i ng. The associated transposition graph is the star K 1;n?1 (see ST (4) depicted on Figure 4 and the associated transposition graph depicted on Figure 5). A complete rotation! is dened on ST (n) by!(x) = x?1, where the permutation is given by = (1; 3; 4; : : : ; n; ) = h; 3; : : : ; ni. A.5. Generalized star graph The generalized star graph GST (n; k) is dened as the Cayley graph of the group S n generated by the set of all the transpositions hi; ji of X, with i f1; ; kg and j fk + 1; ; ng. We prove in [14] that this graph is rotational if and only if k and n? k are co-prime. A.6. Modied bubble sort graph The modied bubble sort graph of dimension n, MBS(n), is dened as the Cayley graph of the group S n generated by the n transpositions fhi; i + 1i; 1 i < ng [ fhn; 1ig. The associated transposition graph is the cycle on n vertices C n. MBS(n) has a complete rotation! dened by!(x) = x?1 where is the cyclic permutation given by h1; ; : : : ; ni.

21 Heydemann, Marlin, P rennes: Rotations in Cayley iii 134 <1,4> 431 <1,> <1,3> <1,> <1,3> <1,3> <1,> <1,4> <1,4> <1,3> <1,> <1,> <1,3> <1,> <1,3> <1,4> <1,4> <1,4> <1,4> <1,4> <1,4> <1,4> 314 <1,4> 143 <1,3> <1,> <1,3> <1,> <1,> <1,3> <1,> <1,3> <1,3> <1,> <1,3> <1,> 341 <1,4> 413 Figure 4: Star graph ST(4) Figure 5: Transposition graph for ST(4).

22 Heydemann, Marlin, P rennes: Rotations in Cayley iv <,3> <1,4> <,4> <1,3> 134 <1,4> <,3> <1,3> <,4> <,4> <1,3> <,3> <1,4> 413 <1,3> <,4> <1,4> <,3> Figure 6: GST(4; ) = M BS(4) Figure 7: Transposition graph for GST(4; ) and M BS(4). B. Notation? a graph V? its vertex set E? its edge set [x; y] an edge A? the arc set = {(x; y) s.t. [x; y] is an edge} V? V? L(?) the line-graph of? Aut(?) the graph-automorphism group of?

23 Heydemann, Marlin, P rennes: Rotations in Cayley G a group I unit Aut(G) the automorphism group of the group G S G a subset hsi the group generated by S Stab(G; S) subgroup of Aut(G) = fh Aut(G); h(s) = Sg Cay(G; S) the Cayley graph of the group G and the subset S H a subgroup of Stab(G; S) H the induced subgroup of Aut(Cay(G; S)) ((1); ; (n)) a permutation on X = f1; ; ng (( (1)); ; ( (n))) S X the group of permutations on X S n the group of permutations on f1 ng = hi 1 ; i ; : : : ; i k i the cycle (or cyclic permutation) dened by (i 1 ) = i ; : : : (i k?1 ) = i k ; (i k ) = i 1 hi; ji transposition Supp fi X; (i) 6= ig v References 1. S. Akers and B. Krishnamurthy. A group theoretic model for symmetric interconnection networks. IEEE Trans. Comput., 38:555566, J.-M. Arnaudies and J. Bertin. Groupes, alg bres et g om trie, volume 1. Ellipses, Paris, J.-C. Bermond, F. Comellas, and D. F. Hsu. Distributed loop computer networks: a survey. J. Parallel Distrib. Comput., 4:10, J.-C. Bermond, T. Kodate, and S. 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 110 of Lecture Notes in Comput. Sci., Springer Verlag, pages , N. Biggs. Algebraic Graph Theory. Cambridge University Press, N. Biggs and A. White. Permutation groups and combinatorial structures, volume 33. London Mathematical Society, Lecture Note Series, Cambridge University Press, H. Coxeter and W. Moser. Generators and relations for discrete groups. Springer, New-York, C. Delorme. Isomorphisms of transposition graphs, D. D s rable. A family of Cayley graphs on the hexavalent grid. Special issue on network communications, Discrete Appl. Math., 1997.

24 Heydemann, Marlin, P rennes: Rotations in Cayley vi 10. P. Fragopoulou. Communication and fault tolerance algorithms on a class of interconnection networks. PhD thesis, Queen'University, Kingston, Canada, P. Fragopoulou and S. G. Akl. Spanning graphs with applications to communication on a subclass of the Cayley graph based networks. Discrete Appl. Math., submitted. 1. P. Fraigniaud and J. G. Peters. Minimum linear gossip graphs and maximal linear (; k)-gossip graphs. Technical Report TR 94-06, Simon Framer University, M.-C. Heydemann. Cayley graphs and interconnection networks. to appear in Proceedings Graph Symmetry, Montreal,1996, NATO ASI C, M.-C. Heydemann, N. Marlin and S. P rennes. Cayley graphs with complete rotations. Research Report: INRIA D. L. Johnson. Presentation of groups, volume. London Mathematical Society, Lecture Note Series, Cambridge University Press, W. Kn del. New gossips and telephones. Discrete Mathematics, 95(13), S. Lakshmivarahan, J. Jwo, and S. K. Dhall. Symmetry in interconnection networks based on Cayley graphs of permutation groups: a survey. Parallel Comput., 19:361407, N. Marlin. Rotations compl tes dans les graphes de Cayley. DEA, Universit de Nice Sophia-Antipolis, France, D. J. S. Robinson. A course in theory of groups, second edition. Springer, G. Sabidussi. On a class of xed-point-free graphs. Proc. Amer. Math. Soc., 9:800804, G. Sabidussi. Graph multiplication. Math. Zeitschr., 7:446457, M. E. Watkins. Connectivity of transitive graphs. J. Combin. Theory, 8:3 9, M. E. Watkins. On the action of non-abelian groups on graphs. J. Combin. Theory, 11:95104, A. White. Graphs, groups and surfaces, volume 8. North Holland Mathematical Studies, Netherlands, 1984.