International Journal of Algebra, Vol. 5, 2011, no.

22, 1073 - 1084

A Class of Double Coset Cayley Digraphs Induced by Loops

Anil Kumar V. Department of Mathematics, University of Calicut Malappuram, Kerala, India 673 635 anilashwin2003@yahoo.com
Abstract In this paper we introduce a new class of double coset Cayley digraphs induced by loops. These graphs can be considered as the generalization of Double coset Cayley digraphs induced by groups . Moreover, various graph properties are expressed in terms of algebraic properties. This did not attract much attention in the literature.

Mathematics Subject Classication: 05C25 Keywords: quasigroup, loop, cayley digraph, double coset cayley digraph, vertex-transitive graph

Introduction

A binary relation on a set V is a subset E of V V . A digraph is a pair (V, E) where V is a non-empty set (called vertex set) and E is a binary relation on V . The elements of E are the edges of the digraph. A digraph (V, E) is called vertex-transitive if, given any two vertices a and b of V , there is some automorphism f : V V such that f (a) = b. In other words, a graph is vertex-transitive if its automorphism group acts transitively upon its vertices [4]. Whenever the word graph is used in this paper it will be referring to a digraph unless otherwise stated. A non-empty set G, together with a mapping : G G G is called a groupoid. The mapping is called a binary operation on the set G. If a, b G, we use the symbol ab to denote (a, b). A groupoid (G, ) is called a quasigroup, if for every a, b G, the equations, ax = b and ya = b are uniquely solvable in G [9]. This implies both left and right cancelation laws. A quasigroup with an identity element is called a loop [9]. Observe that a loop is a weaker algebraic structure than a group.

1074

Anil Kumar V.

A subset A of a loop G is said to be a right associative subset of G, if for every x, y G, (xy)A = x(yA) [10]. In this sequel we we need the following results: Theorem 1.1. ([10]) Let A and B be right associative subsets of a loop G. Then so are AB and A = {x : xa = 1, a A}, where 1 is the identity element in G. Similarly, we can dene the left associative subset of a loop G and prove the following: Theorem 1.2. Let A and B be left associative subsets of a loop G. Then so are AB and Ar = {x : ax = 1, a A}. Let G be a group and let D be a subset of G. The Cayley digraph X = C(G, D) is the digraph with vertex set G, and the vertex x is adjacent to the vertex y if and only if x1 y D [4]. The subset D is called the connection set of X. That is, Cayley digraph C(G; D) has as its vertex-set and edge-set, respectively, V = G and E = {(x, y) : y = xz for some z D}. In [12], the author introduced a class of digraphs induced by groups as follows: Theorem 1.3. ( V. A. Kumar [12]) Let G be a group and let A and B be subgroups of G. Let D and D be subsets of G. Let G/[A, B] denote the collection of all double cosets of A and B in G. Let RD,D = {(AxB, AyB) : y = z1 xz2 for some Then (G/[A, B], RD,D ) is a graph. The graph dened in theorem 1.3 is called the double coset cayley digraph induced by groups [12]. Observe that when A = B = D = {1}, the double coset cayley digraph (G/[A, B], RD,D ) reduces to Cayley digraph graph X = C(G, D ). In this paper, we introduce a new class of double coset Cayley digraphs induced by loops. These graphs can be considered as the generalization of Double coset Cayley digraphs dened in theorem 1.3. z1 ADA, z2 BD B}

Main Theorem

In [12], the author studied a class of double coset cayley digraphs induced by groups and obtained interesting relationship between properties of graphs and those of groups. In this paper, we prove that a bigger class of double coset Cayley digraphs can be induced by loops. These graphs can be considered as

A class of double coset Cayley digraphs induced by loops

1075

the generalization of those obtained in [12]. Moreover analogues results are obtained between the properties of graphs and those of loops. Let G be a loop and let x1 , x2 , , xn G, we shall denote the product ( ((x1 x2 )x3 ) )xn1 )xn by x1 x2 xn . Theorem 2.1. Let G be a loop and let A and B be subloops of G such that A is left associative and B is right associative. Let G/[A, B] denote the collection of all double cosets of A and B in G. Let D and D be subsets of G such that D is left associative and D is right associative. Let RD,D = {(AxB, AyB) : y = (z1 x)z2 for some z1 ADA, z2 BD B} . Then (G/[A, B], RD,D ) is a graph. Proof. To see that (G/[A, B], RD,D ) is a graph, we need only show that RD,D is well dened. Let x, x , y and y be any four elements of G with AxB = Ax B and AyB = Ay B. Then we have x = (a1 x)b1 , for some a1 A and b1 B and y = (a2 y)b2 If (AxB, AyB) RD,D , then y = (z1 x)z2 for some z1 ADA and z2 BD B. (3) for some a2 A and b2 B. (2) (1)

Let z1 = (a3 d1 )a4 and z2 = (b3 d2 )b4 , where a3 , a4 A, b3 , b4 B, d1 D and d2 D . Then equation (3) can be written as: y = (z1 x)((b3 d2 )b4 ) = (z1 x)(((b1 b5 )d2 )b4 ) where b3 = b1 b5 = (z1 x)((b1 b5 )(d2 b6 ) for some b6 B ( B is right associative) = (z1 x)(b1 (b5 (d3 b7 ))) for some d3 D , b7 B ( D B is right associative) = (z1 x)(b1 ((b5 d3 )b8 ))) for some b8 B ( B is right associative) (4) = (z1 x)(b1 z3 ) where z3 = (b5 d3 )b8 Inserting z1 = (a3 d1 )a4 in equation (4), we get y = (((a3 d1 )a4 )x)(b1 z3 ) = (((a3 d1 )(a5 a1 ))x)(b1 z3 ) where a4 = a5 a1 = (((a6 d4 )a5 )a1 )x)(b1 z3 ) for some a6 A, d4 D ( AD is left associative) = ((z4 a1 )x)(b1 z3 ) where z4 = (a6 d4 )a5

1076

Anil Kumar V.

= ((z5 (a1 x))(b1 z3 ) for some z5 ADA ( ADA is left associative) = ((z5 (a1 x)b1 )z6 for some z6 BD B ( BD B is right associative) = (z7 ((a1 x)b1 ))z6 for some z7 ADA ( ADA is left associative) = (z7 x )z6 Again inserting y = (z7 x )z6 in equation (2), we get

(5)

y = (a2 ((z7 x )z6 ))b2 = a2 (((z7 x )z6 )b3 ) for some b3 B ( B is right associative) = a2 ((z7 x )(z6 b4 )) for some b6 B ( B is right associative) = (a3 (z7 x ))(z6 b4 ) for some a3 A ( A is left associative) = ((a4 z7 )x )(z6 b4 ) for some a4 A ( A is left associative) = ((a4 ((a7 d7 )a8 ))x )(z6 b4 ) where z7 = (a7 d7 )a8 = (((a5 (a7 d7 )a8 )x )(z6 b4 )) for some a5 A ( A is left associative) = ((((a6 a7 )d7 )a8 )x )(z6 b4 ) for some a6 A ( A is left associative) = (((a9 d7 )a8 )x )(z6 b4 ) where a9 = a6 a7 = (z8 x )(z6 b4 ) where z8 = (a9 d7 )a8 ADA = (z8 x )(((b6 d6 )b7 )b4 ) where z6 = (b6 d6 )b7 = (z8 x )((b6 d6 )(b7 b5 )) for some b5 B ( B is right associative) = (z8 x )((b6 d6 )b8 ) where b8 = b7 b5 ADA = (z8 x )z9 where z9 = (b6 d6 )b8 BD B (6) Equation (6) tells us that (Ax B, Ay B) RD,D . Similarly, if (AxB, AyB) RD,D , we can show that (AxB, AyB) RD,D . Hence RD,D is well dened and hence (G/[A, B], RD,D ) is a graph. Observe that when A = B = D = {1}, then (G/[A, B], RD,D ) reduces to the digraph (G, RD ), where RD = {(x, y) : y = xz for some z D } . Note that the graph (G, RD ) is the cayley digraph induced by loops. It is well known that (G, RD ) is vertex- transitive. Denition 2.2. The graph dened in theorem 2.1 is called the double coset cayley digraph induced by loops. The graph dened above can be considered as the generalization of the double coset cayley digraph dened in [12].

A class of double coset Cayley digraphs induced by loops

1077

Corollaries

In this section, we prove some interesting relationship between the properties of (G/[A, B], RD,D ) and those of loops. Let A and B be subsets of a loop G. In this sequel, we introduce the following notations. (1) [A|B] : ={x G : x = (z1 x)z2 for some z1 A, z2 B}. (2) [A] : =the set of all nite products of elements of A. (3) [A|B] : ={(a1 (a2 ((an1 (an bn ))bn1 ) b2 )b1 : ai A, bi B, n = 1, 2, 3, . . . }. Corollary 3.1. The (G/[A, B], RD,D ) is an empty graph if and only if D = or D = . Proof. Observe that (G/[A, B], RD,D ) is empty RD,D = ADA = or BD B = D = or D = ( 1 A B).

Corollary 3.2. The (G/[A, B], RD,D ) is a reexive graph if and only if G = [(ADA)|(BD B)] . Proof. Suppose that (G/[A, B], RD,D ) is a reexive graph and let x G. Then (AxB, AxB) RD,D . This implies that x = (z1 x)z2 for some z1 ADA, z2 BD B. This implies that x [ADA|BD B] . Since x is an arbitrary element in G, it follows that G = [(ADA)|(BD B)] . Conversely, assume that G = [ADA|BD B] . We will show that (AxB, AxB) RD,D for all x G. Observe that x G x [ADA|BD B] x = (z1 x)z2 , for some z1 ADA, z2 BD B (AxB, AxB) RD,D . Hence (G/[A, B], RD,D ) is reexive. Corollary 3.3. If (G/[A, B], RD,D ) is a symmetric graph , then (ADA)(BD B) = (ADA)r (BD B) .

1078

Anil Kumar V.

Proof. First, assume that (G/[A, B], RD,D ) is symmetric. Observe that x (ADA)(BD B) x = z1 z2 , for some z1 ADA, z2 BD B (AB, AxB) RD,D (AxB, AB) RD,D 1 = (t1 x)t2 for some t1 ADA, t2 BD B (t2 ) t2 = (t1 x)t2 where (t2 ) t2 = 1 (t2 ) = t1 x (t1 (t1 )r )(t2 ) = t1 x where t1 (t1 )r = 1 t1 ((t1 )r )(t3 ) = t1 x for some (t3 ) (BD B) x = (t1 )r (t3 ) This implies that (ADA)(BD B) = (ADA)r (BDB) .

Corollary 3.4. If (ADA) = (ADA)r and (BD B) = (BD B) , then (G/[A, B], RD,D ) is symmetric. Proof. let AxB and AyB be any two vertices of (G/[A, B], RD,D ) such that (AxB, AyB) RD,D . But then y = (z1 x)z2 for some z1 ADA, z2 BD B. (7)

Let x = (t1 y)t2 . We will show that t1 ADA and t2 BD B. Inserting x = (t1 y)t2 in equation (7), we get y = (z1 ((t1 y)t2 ))z2 = ((z3 (t1 y)t2 )z2 for some z3 ADA ( ADA is left associative) = (((z4 t1 )y)t2 )z2 for some z4 ADA ( ADA is left associative) = ((z4 t1 )y)(t2 z5 ) for some z5 BD B ( BD B is right associative) (8) Observe that equation (8) is satised when z4 t1 = 1 and t2 z5 = 1. This implies that t1 (ADA)r and t2 (BD B) . Since ADA = (ADA)r and (BD B) = (BD B) , it follows that (AyB, AxB) RD,D . Hence (G/[A, B], RD,D ) is symmetric. Corollary 3.5. (G/[A, B], RD,D ) is a transitive graph, then (ADADA)(BD BD B) (ADA)(BD B). Proof. Assume that (G/[A, B], RD,D ) is a transitive graph. z1 , z2 ADA, z3 , z4 BD B, we have Then for all

(AB, Az1 z3 B) and (Az1 z3 B, A(z2 (z1 z3 ))z4 B) RD,D

A class of double coset Cayley digraphs induced by loops

1079

This implies that (AB, A(z2 (z1 z3 )z4 )B) RD,D The above statement tells us that (z2 (z1 z3 ))z4 = t1 t2 for some t1 ADA, t2 BD B. The left hand side of equation (9) can be written as: (z2 (z1 z3 ))z4 = ((z5 z1 )z3 )z4 for some z5 ADA = (z5 z1 )(z3 z6 ) for some z6 BD B Note that (z5 z1 )(z3 z6 ) ((ADA)(ADA))((BDB)(BD B)) = (ADADA)(BD BD B). Also note that t1 t2 (ADA)(BD B). (ADADA)(BD BD B) (ADA)(BD B). (9)

Hence from equation (9) it is evident that

Corollary 3.6. If ADADA ADA and BD BD B BD B, then (G/[A, B], RD,D ) is a transitive graph. Proof. Let AxB, AyB and AzB G/[A, B] such that (AxB, AyB) RD,D and (AyB, AzB) RD,D . Then y = (z1 x)z2 for some z1 ADA, z2 BD B and z = (z3 y)z4 for some z3 ADA, z4 BD B. This implies that z = (z3 ((z1 x))z2 )z4 (10)

Since ADA is left associative and BD B is right associative, equation (10) can be written as z = ((z5 z6 )x)(z7 z8 ) for some z5 , z6 ADA and z7 , z8 BD B. Since ADADA ADA and BD BD B BD B, it follows that (AxB, AzB) RD,D . Hence (G/[A, B], RD,D ) is a transitive graph. Corollary 3.7. If (G/[A, B], RD,D ) is a complete graph, then G = (ADA)(BD B).

1080

Anil Kumar V.

Proof. Assume that (G/[A, B], RD,D ) is a complete graph and let x G. Then (AB, AxB) RD,D . This implies that x = z1 z2 , for some z1 ADA and z2 BD B. That is, x (ADA)(BD B). Since x is an arbitrary element of G, G = (ADA)(BD B) Corollary 3.8. If G = (ADA)(BD B), ADADA ADA, BD BD B BD B and (z1 x)z2 = (z2 x)z1 for all z1 ADA, z2 BD B, x G, then (G/[A, B], RD,D ) is a complete graph. Proof. Let AxB and AyB be any two elements in G/[A, B] such that y = (z1 x)z2 . Then z1 , z2 G. Since G = (ADA)(BD B), we have z1 = t1 w1 for some t1 ADA, w1 BD B, z2 = t2 w2 for some t2 ADA, w2 BD B. Inserting the values of z1 and z2 in the equation y = (z1 x)z2 , we get: y = ((t1 w1 )x)(t2 w2 ) = (t3 (w1 x))(t2 w2 ) for some t3 ADA = t4 ((w1 x)(t2 w2 )) for some t4 ADA = t4 (((w1 x)t2 )w3 ) for some w3 BD B = t4 (x1 w3 ) where x1 = (w1 x)t2 = (t2 x)w1 = (t5 x1 )w3 for some t5 ADA. The above equation tells us that (AxB, Ax1 B) RD,D and (Ax1 B, AyB) RD,D . Since ADADA ADA and BD BD B BD B, it follows that (AxB, AyB) RD,D . Corollary 3.9. If (G/[A, B], RD,D ) is connected, then G = [ADA|BD B]. Proof. Suppose that (G/[A, B], RD,D ) is connected and let x G. Then there is a path from AB to AxB, say: (AB, Ax1 B, Ax2 B, , Axn B, AxB) Then we have x1 = z1 t1 , x2 = (z2 x1 )t2 , . . . , xn = (zn xn1 )tn , x = (zn+1 xn )tn+1 for some zi ADA and ti BD B. This implies that x = (zn+1 xn )tn+1 = (zn+1 ((zn xn1 )tn ))tn+1

A class of double coset Cayley digraphs induced by loops

1081

. . . = (zn+1 ( (z2 (z1 t1 ))t2 ))tn+1 Equivalently, G = [ADA|BD B].

Corollary 3.10. If G = [ADA|BD B] and (z1 x)z2 = (z2 x)z1 for all z1 ADA, z2 BD B, x G, then (G/[A, B], RD,D ) is connected. Corollary 3.11. If (G/[A, B], RD,D ) is locally connected, then [ADA|BD B] = [ADA]r [BD B] Proof. Assume that (G/[A, B], RD,D ) is locally connected. Let x [ADA|BD B]. Then x = z1 z2 . . . zn tn tn1 . . . t2 t1 for some zi ADA and ti BD B. Let x1 = zn tn , x2 = (zn1 x1 )tn1 , . . . , xn = (z1 xn1 )t1 Then (AB, Ax1 B, . . . , Axn B, Axn B) is a path from AB to AxB. Since (G/[A, B], RD,D ) is locally connected, there exits a path from AxB to AB, say: (AxB, Ay1 B, . . . , Aym B, AB) This implies that x [ADA]r [BD B] . Hence [ADA|BD B] [ADA]r [BD B] . Similarly, [ADA]r [BD B] [ADA|BD B]. Corollary 3.12. If (G/[A, B], RD,D ) is semi connected, then G = [ADA|BD B] [ADA]r [BD B] . Proof. Assume that (G/[A, B], RD,D ) is semi connected and let x G. then there exits a path from AB to AxB, say (AB, Ax1 B, . . . , Axn B, AxB) or a path from AxB to AB, say (AxB, Ay1 B, . . . , Aym B, AB) This implies that x [ADA|BD B] [ADA]r [BD B] . Since x is arbitrary, it follows that G = [ADA|BD B] [ADA]r [BD B] .

1082

Anil Kumar V.

Corollary 3.13. If (G/[A, B], RD,D ) is a quasi ordered set, then (i) G = [(ADA)|(BDD)] , (ii) ADADA)(BD BD B) (ADA)(BD B). Corollary 3.14. If G = [(ADA)|(BD D)] , ADADA ADA and BD BD B BD B, then (G/[A, B], RD,D ) is a quasi ordered set. Corollary 3.15. If (G/[A, B], RD,D ) is a partially ordered set, then (i)(ADA)(BD B) (ADA)r (BD B) = AB, (ii)(ADA)(ADA)(BD B)(BD B) (ADA)(BD B). Corollary 3.16. If the following conditions are satised then (G/[A, B], RD,D ) is a partially ordered set. (i)G = [(ADA)|(BD D)] , (ii)(ADA) (ADA)r = or (BD B) (BD B) = , (ii)(ADAADA) ADA, BD BD B BD B. Corollary 3.17. If (G/[A, B], RD,D ) is a linearly ordered set, then (i) (ADA)(BD B) (ADA)r (BD B) = AB, (ii) (ADA)(ADA)(BD B)(BD B) (ADA)(BD B), (iii) (ADA)(BD B) (ADA)r (BD B) = G. Corollary 3.18. (G/[A, B], RD,D ) is a hasse- diagram, if and only if (ADA)n (ADA) = or (BD B)n (BD B) = , n 2. Proof. First, assume that (G/[A, B], RD,D ) is a hasse- diagram. Then for any vertices Ax0 B, Ax1 B, . . . , Axn B G/[A, B] with (Axi B, Axi+1 B) RD,D for all i = 0, 1, 2, . . . , n 1 implies that (Ax0 B, Axn B) RD,D . Observe that / (Axi B, Axi+1 B) RD,D for all i = 0, 1, 2, . . . , n 1 implies that x1 = (z1 x0 )t1 for some z1 ADA, t1 BD B, x2 = (z2 x1 )t2 for some z2 ADA, t2 BD B = (z2 ((z1 x0 )t1 ))t2 = (z2 ((z1 x0 )t1 ))t2 for some z2 ADA = ((z2 (z1 x0 ))t1 )t2 for some z2 ADA = (((w2 z1 )x0 )t1 )t2 for some w2 ADA = ((w2 z1 )x0 )(t1 u2 ) for some u2 BD B, x3 = (z3 x2 )t3 for some z3 ADA, t3 BD B

A class of double coset Cayley digraphs induced by loops

1083

= (z3 (((w2 z1 )x0 )(t1 u2 )))t3 = (((v1 v2 )v3 )x0 )(((r1 r2 )r3 )) for some vi ADA, ri BD B . . . xn = (zn xn1 )tn for some zn ADA, tn BD B = (((s1 s2 )s3 ) sn )x0 (((k1 k2 )k3 ) kn ) for some si ADA, ki BD B = z1 x0 z2
where z1 = (((s1 s2 )s3 ) sn ) (ADA)n and z2 = (((k1 k2 )k3 ) kn ) (BD B)n . Since (Ax0 B, Axn B) RD,D , therefore /

(ADA)n (ADA) = or (BD B)n (BD B) = . Conversely, assume that (ADA)n (ADA) = or (BD B)n (BD B) = , n 2. We will show that (G/[A, B], RD,D ) is a hasse-diagram. Let Ax0 B, Ax1 B, . . . , Axn B be any (n + 1) elements of G/[A, B] with n 2, and (Axi B, Axi+1 B) RD,D for all i = 0, 1, 2, . . . , n 1. Then we have xn = zn zn1 . . . z2 z1 x0 t1 t2 . . . tn
for some zi ADA and ti BD B This implies that xn = z1 x0 z2 for some n n n z1 (ADA) and z2 (BD B) . Since (ADA) (ADA) = or (BD B)n / (BD B) = , (Ax0 B, Axn B) RD,D . Hence (G/[A, B], RD,D ) is a hassediagram.

Questions

It is well known that all Cayley digraphs induced by groups and loops are vertex transitive graphs [4, 10]. So the question is: Whether the Double coset Cayley digraphs induced by groups and loops are vertex- transitive or not ? Hence we propose the following problem: Problem 4.1. Prove or disprove that double coset Cayley digraphs dened in theorems (1.3) and (2.1) are vertex-transitive.

1084

Anil Kumar V.

References
[1] B. Alspach and C. Q. Zhang, Hamilton cycles in cubic Cayley graphs on dihedral groups, Ars Combin. 28 (1989), 101 108. [2] B. Alspach, S. Locke and D. Witte, The Hamilton spaces of Cayley graphs on abelian groups, Discrete Math. 82 (1990), 113 126. [3] B. Alspach and Y. Qin, Hamilton-Connected Cayley graphs on Hamiltonian groups, Europ. J. Combin. 22 (2001), 777 787. [4] C. Godsil and R. Gordon , Algebraic Graph Theory, Graduate Texts in Mathematics, New York: Springer-Verlag, 2001. [5] D. Witte, On Hamiltonian circuits in Cayley diagrams, Discrete Math. 38 (1982), 99 108. [6] D. Witte, Cayley digraphs of prime-power order are Hamiltonian, J. Combin. Theory Ser. B 40 (1986), 107 112. [7] D. Witte and K. Keating, On Hamilton cycles in Cayley graphs in groups with cyclic commutator subgroup, Ann. Discrete Math. 27 (1985), 89 102. [8] G. Sabidussi, On a class of fxed-point-free graphs, Proc. Amer. Math. Soc. 9(1958), 800 804. [9] H.B. Richard, A survey of binary systems, Springer- Verlag New York, 1971 [10] H.H. Teh and S.C. Shee, Algebraic Theory of graphs, Lee Kong Chian Institute of Mathematics and Computer Science, Singapore, 1976 [11] J. B. Fraleigh, A First course in abstract algebra, Pearson Education, 2008. [12] V. A. Kumar, Double Coset Cayley Digraphs, International Journal of Algebra, 5 (2011), no. 15, 747 753( to appear). [13] S. B. Akers and B. Krishamurthy, A group theoritic model for symmetric interconnection networks, IEEE Trans. comput. 38 (1989), 555 556. [14] S. J. Curran and J. A. Gallian, Hamiltonian cycles and paths in Cayley graphs and digraphs- A survey, Discrete Math., 156 (1996) 1 18. [15] S.Lakshmivarahan, J. Jwo and S. K. Dhall, Symmetry in interconnection networks based on Cayley graphs of permutation groups- A survey, Parallel Comput. 19(1993), 361 407. Received: May, 2011