Decomposition of Cartesian Product of Complete Graphs into Sunlet Graphs of Order Eight
K. Sowndhariya and A. Muthusamy
Department
of Mathematics, Periyar University, Salem,
Tamil Nadu, India.
Abstract
For any integer k≥3 , we define the sunlet graph of order 2k, denoted by L2k, as the graph consisting of a cycle of length k together with k pendant vertices such that, each pendant vertex adjacent to exactly one vertex of the cycle so that the degree of each vertex in the cycle is 3. In this paper, we establish necessary and sufficient conditions for the existence of decomposition of the Cartesian product of complete graphs into sunlet graph of order eight.
2010 Mathematics Subject Classification: 05C51
Keywords: Graph decomposition, Cartesian Product, Corona graph, Sunlet graph
1 Introduction
All graphs considered here are finite, simple and undirected. A cycle of length k is called k-cycle and it is denoted by Ck. Km denotes the complete graph on m vertices and Km,n denotes the complete bipartite graph with m and n vertices in the parts. We denote the complete m-partite graph with n1,n2,…,nm vertices in the parts by Kn1,n2,…,nm. For any integer λ>0, λG denotes the graph consisting of λ edge-disjoint copies of G.
For any two graphs G and H of orders m and n, respectively, the corona product G⊙H is the graph obtained by taking one copy of G and m copies of H such that the ith vertex of G is connected to every vertex in the ith copy of H. We define the sunlet graph L2k with V(L2k) = {x1,x2,…,xk,xk+1,xk+2,…,x2k} and E(L2k) = {xixi+1∪xixk+i ∣ i=1,2,...,k and subscripts of the first term is taken addition modulo k}. We denote it by
L2k = (x1xk+1x2xk+2……xkx2k).
Clearly, L2k≅Ck⊙K1.
The Cartesian product of two graphs, G and H, denotes by G□H, has the vertex set V(G)×V(H) and in which two vertices (g,h) and (g′,h′) are adjacent if and only if either g=g′ and h is adjacent to h′ in H or h=h′ and g is adjacent to g′ in G. It is well known that Cartesian product is commutative, associative and distributive over edge-disjoint union of graphs.
We shall use the following notation throughout the paper. Let G and H be simple graphs with vertex sets V(G) = {x1,x2,…,xn} and V(H) = {y1,y2,…,ym}. Then for our convenience, we write V(G)×V(H) = ⋃i=1n Xi, where Xi stands for xi×V(H). Further, in the sequel, we shall denote the vertices of Xi as {xij∣1≤j≤m}, where xij stands for the vertex (xi,yj)∈V(G)×V(H).
By a decomposition of a graph G, we mean a list of edge-disjoint subgraphs whose union is G. For a graph G, if E(G) can be partitioned into E1,E2,...,Ek such that the subgraph induced by Ei is Hi, for all i, 1≤i≤k, then we say that H1,H2,...,Hk decompose G and we write G = H1 ⊕ H2 ⊕... ⊕ Hk, since H1,H2,...,Hk are edge-disjoint subgraphs of G. For 1≤i≤k, if Hi = H, we say that G has a H- decomposition.
Study of H-decomposition of graphs is not new. Many authors around the world are working in the field of cycle decomposition, path decomposition, star decompositon, trail decomposition, Hamilton cycle decomposition problems in graphs. Here we consider the sunlet decomposition of product graphs. Anitha and Lekshmi [2, 3] proved that n-sun decomposition of complete graph, complete bipartite graph and the Harary graphs. Liang and Guo [8, 9] gave the existence spectrum of a k-sun system of order v as k=2,4,5,6,8. Fu et. al. [5, 6] obtained that 3-sun decompositions of Kp,p,r, Knand embed a cyclic steiner triple system of order n into a 3-sun system of order 2n−1, for n=1(mod6). Further they obtained k-sun system when k=6,10,14,2t, for t>1. Fu et. al. [4] obtained the existence of a 5-sun system of order v. Gionfriddo et.al. [7] obtained the spectrum for uniformly resolvable decompositions of Kv into 1-factor and h-suns. Akwu and Ajayi [1] obtained the necessary and sufficient conditions for the existence of decomposition of Kn⊗Km and (Kn−I)⊗Km, where I denote the 1-factor of a complete graph into sunlet graph of order twice the prime. Sowndhariya and Muthusamy [10] obtained necessary and sufficient conditions for the existence of decomposition of Km×Kn and Km⊗Kn into sunlet graph of order eight.
In this paper, we prove the existence of L8-decomposition of Km□Kn. In fact, we establish necessary and sufficient conditions for the existence of L8-decomposition of Km□Kn. To prove our results, we state the following:
Theorem 1.1** ([10]).**
For k≥3, K4k+1 has a L2k- decomposition.
Theorem 1.2** ([10]).**
For an integer p>0, K16p+1 has a L8- decomposition.
Lemma 1.1** ([10]).**
There exists a L8- decomposition of K16.
Theorem 1.3** ([10]).**
For any m,n≥4, Km,n has a L8- decomposition if and only if mn≡0 (mod 8) except (m,n)=(8,5),(4,4r+2) where r>0.
2 Decomposition of Km□Kn into Sunlet Graph of order Eight
2.1 Necessary Conditions
Lemma 2.1**.**
If Km□Knhas an L8-decomposition, then either
-
m,n≡ 0 (mod 4)**
2. 2.
m≡ 0 (mod 8), n≡ 0 (mod 2)**
3. 3.
m≡ 0 (mod 16)**
4. 4.
m≡ 1 (mod 16), n≡ 1 (mod 16)**
5. 5.
m≡ 15 (mod 16), n≡ 3 (mod 16)**
6. 6.
m≡ 13 (mod 16), n≡ 5 (mod 16)**
7. 7.
m≡ 11 (mod 16), n≡ 7 (mod 16)**
8. 8.
m≡ 9 (mod 16), n≡ 9 (mod 16)**
Proof.
The graph Km□Kn has mn vertices, each having degree m+n−2. Hence, Km□Kn has 2mn(m+n−2) edges. Assume that Km□Kn admits an L8- decomposition. Then the number of edges in the graph must be divisible by 8. i.e., 16∣mn(m+n−2). Hence these conditions are met in each of the above eight cases and only in these cases.
∎
2.2 Sufficient Conditions
We now prove the above necessary conditions are also sufficiency.
Lemma 2.2**.**
If m≡0(mod4) and n≡0(mod4), then the graph Km□Kn has an L8-decomposition.
Proof.
Let m=4s and n=4t for some s,t>0. We can divide the graph Km□Kn into st(K4□K4) and the remaining graph can be viewed as 2st(s+t−2)K4,4. The L8-decomposition of K4□K4 is shown in Fig 1. By Theorem 1.3, K4,4 has an L8-decomposititon. Hence the graph Km□Kn has the desired decomposition.
∎
Lemma 2.3**.**
If m≡0(mod8) and n≡0(mod2), then the graph Km□Kn has an L8-decomposition.
Proof.
Let m≡0(mod8) and n≡0 (or) 4(mod8), then the proof follows from Lemma 2.2. Now let m=0(mod8) and consider two cases for n.
Case (1) n≡ 2(mod8).
Let m=8s and n=8t+2 for some s,t>0. Then we can write Km□Kn as s(t−1)(K8□K8) ⊕ s(K8□K10) ⊕ 2s[(t−1)(t−2)+(8t+2)(s−1)]K8,8 ⊕ 8s(t−1)K8,10. An L8-decomposition of K8□K10 is presented in Appendix 4.1.1 and the L8-decomposition of the graphs K8□K8, K8,8 and K8,10 follows from Lemma 2.2 and Theorem 1.3.
Case (2) n≡ 6(mod8).
Let m=8s and n=8t+6 for some s,t>0. Then we can write Km□Kn as st(K8□K8) ⊕ s(K8□K6) ⊕ s[(s−1)(4t+3)+4t(t−1)]K8,8 ⊕ 8stK8,6. An L8-decomposition of K8□K6 is appears in Appendix 4.1.2 and the L8-decomposition of the remaining graphs follows from Lemma 2.2 and Theorem 1.3. Hence the graph Km□Kn has the desired decomposition.
∎
Lemma 2.4**.**
If m≡0(mod16), then the graph Km□Kn has an L8-decomposition.
Proof.
Let m≡0(mod16) and n≡0,2,4,6(mod8), then the proof follows from Lemma 2.3. Let m=0(mod16) and consider four cases for odd n.
Case (1) n≡ 1(mod8).
Let m=16s and n=8t+1 for some s,t>0. Then we can write Km□Kn as s(t−1)(K16□K8) ⊕ s(K16□K9) ⊕ 8s(t−1)(t−2)K8,8 ⊕ 2s(8t+1)(s−1)K16,16 ⊕ 16s(t−1)K8,9. An L8-decomposition of K16□K9 is shown in Appendix 4.2.1 and the L8-decomposition of the remaining graphs follows from Lemma 2.2 and Theorem 1.3.
Case (2) n≡ 3(mod8).
Let m=16s and n=8t+3 for some s,t>0. Then we can write Km□Kn as s(t−1)(K16□K8) ⊕ s(K16□K11) ⊕ 8s(t−1)(t−2)K8,8 ⊕ 2s(8t+3)(s−1)K16,16 ⊕ 16s(t−1)K8,11. An L8-decomposition of K16□K11 is shown in Appendix 4.2.2 and the L8-decomposition of the remaining graphs follows from Lemma 2.2 and Theorem 1.3.
Case (3) n≡ 5(mod8).
Let m=16s and n=8t+5 for some s,t>0. Then we can write Km□Kn as s(t−1)(K16□K8) ⊕ s(K16□K13) ⊕ 8s(t−1)(t−2)K8,8 ⊕ 2s(8t+5)(s−1)K16,16 ⊕ 16s(t−1)K8,13. An L8-decomposition of K16□K13 is presented in Appendix 4.2.3 and the L8-decomposition of the remaining graphs follows from Lemma 2.2 and Theorem 1.3.
Case (4) n≡ 7(mod8).
Let m=16s and n=8t+7 for some s,t>0. Then we can write Km□Kn as st(K16□K8) ⊕ s(K16□K7) ⊕ 8st(t−1)K8,8 ⊕ 2s(8t+7)(s−1)K16,16 ⊕ 16stK8,7. An L8-decomposition of K16□K7 is presented in Appendix 4.2.4 and the L8-decomposition of the remaining graphs follows from Lemma 2.2 and Theorem 1.3.
Hence the graph Km□Kn has the desired decomposition.
∎
Lemma 2.5**.**
If m≡1(mod16) and n≡1(mod1)6, then the graph Km□Kn has an L8-decomposition.
Proof.
Let m=16s+1 and n=16t+1 for some s,t>0. Then we can write Km□Kn as (16t+1)K16s+1 ⊕ (16s+1)K16t+1. By Theorem 1.2, the graph Km□Kn has the desired decomposition.
∎
Lemma 2.6**.**
If m≡15(mod16) and n≡3(mod16), then the graph Km□Kn has an L8-decomposition.
Proof.
Let m=16s+15 and n=16t+3 for some s,t>0. We can write Km□Kn as (16t+3)K16s+15 ⊕ (16s+15)K16t+1. Now the first 16t columns can be viewed as K16s ⊕ K15⊕sK16,15 and the first 16s rows can be viewed as K16(t−1) ⊕K19 ⊕(t−1)K16,19. Then K16s(=sK16 ⊕ 2s(s−1)K16,16), K16(t−1)(=(t−1)K16⊕2(t−1)(t−2)K16,16), K16,15 and K16,19 has an L8-decomposition by Lemma 1.1 and Theorem 1.3. The graph K19 can be viewed as K19\K3 ⊕ K3. The L8-decomposition of K19\K3 follows from Appendix 4.3.1. Then 16s(K19\K3) has an L8-decomposition. Then the remaining graph can be viewed as s(K16□K3), t(K15□K16) and K15□K3. Hence the desired decomposition follows from Appendixes 4.3.2, 4.3.3 and Lemma 2.4
∎
Lemma 2.7**.**
If m≡13(mod16) and n≡5(mod16), then the graph Km□Kn has an L8-decomposition.
Proof.
Let m=16s+13 and n=16t+5 for some s,t>0. Then we can write Km□Kn as st(K16□K16) ⊕ t(K16□K13) ⊕ s(K16□K5) ⊕ K13□K5 ⊕ 2t(t−1)(16s+13)+s(s−1)(16t+5)K16,16 ⊕ s(16t+5)K16,13 ⊕ t(16s+13)K16,5. An L8-decomposition of K16□K5 and K13□K5 are presented in Appendixes 4.4.1 and 4.4.2, respectively and the L8-decomposition of the remaining graphs follows from Lemma 2.4 and Theorem 1.3. Hence the graph Km□Kn has the desired decomposition.
∎
Lemma 2.8**.**
If m≡11(mod16) and n≡7(mod16), then the graph Km□Kn has an L8-decomposition.
Proof.
Let m=16s+11 and n=16t+7 for some s,t>0. Then we can write Km□Kn as st(K16□K16) ⊕ t(K16□K11) ⊕ s(K16□K7) ⊕ K11□K7 ⊕ 2s(s−1)(16t+7)+t(t−1)(16s+11)K16,16 ⊕ (16t+7)sK16,11 ⊕ (16s+11)tK16,7. An L8-decomposition of K11□K7 is presented in Appendix 4.5.1 and the L8-decomposition of the remaining graphs follows from Lemma 2.4 and Theorem 1.3. Hence the graph Km□Kn has the desired decomposition.
∎
Lemma 2.9**.**
If m≡9(mod16) and n≡9(mod16), then the graph Km□Kn has an L8-decomposition.
Proof.
Let m=16s+9 and n=16t+9 for some s,t>0. Then we can write Km□Kn as st(K16□K16) ⊕ (s+t)(K16□K9) ⊕ K9□K9 ⊕ 2s(s−1)(16t+9)+t(t−1)(16s+9)K16,16 ⊕ [s(16t+9)+t(16s+9)]K16,9. An L8-decomposition of K11□K7 is presented in Appendix 4.6.1 and the L8-decomposition of the remaining graphs follows from Lemma 2.4 and Theorem 1.3. Hence the graph Km□Kn has the desired decomposition.
∎
2.3 Main Theorem
Combining the results from Lemma 2.1 to Lemma 2.9, we get the following main results.
Theorem 2.1**.**
The graph Km□Kn admits an L8- decomposition if and only if one of the following holds:
-
m,n≡ 0 (mod 4)**
2. 2.
m≡ 0 (mod 8), n≡ 0 (mod 2)**
3. 3.
m≡ 0 (mod 16)**
4. 4.
m≡ 1 (mod 16), n≡ 1 (mod 16)**
5. 5.
m≡ 15 (mod 16), n≡ 3 (mod 16)**
6. 6.
m≡ 13 (mod 16), n≡ 5 (mod 16)**
7. 7.
m≡ 11 (mod 16), n≡ 7 (mod 16)**
8. 8.
m≡ 9 (mod 16), n≡ 9 (mod 16)**
3 Acknowledgments:
The first author thank the Department of Science and Technology, Government of India, New Delhi for its financial support through the Grant No.DST/INSPIRE Fellowship/2015/IF150211. The second author thank the University Grant Commission, Government of India, New Delhi for its support through the grant No.F.510/7/DRS-I/2016(SAP-I).
4 Appendix
4.1 L8-decomposition required for Lemma 2.3
4.1.1 An L8- decomposition of K8□K10
(xi1xi3xi6xi8xi2xi4xi7xi9), (xi3xi10xi8xi5xi4xi7xi9xi2), (xi2xi1xi3xi7xi4xi6xi5xi9) for i=1,2,...,8;
(x1jx3jx5jx7jx2jx4jx6jx8j), (x3jx5jx7jx1jx4jx6jx8jx2j) for j=1,2,...,10;
(x1jx8jx2jx7jx3jx6jx4jx5j) for j=1,3,5,7,8,9; (x5jx4jx6jx3jx7jx2jx8jx1j) for j=2,4,6,10;
(xi1xi8xi5xik1xi6xik2xi10xik3) for i=1,2,3,4, (k1,k2,k3)=(3,9,4) & i=5,6,7,8,(k1,k2,k3)=(7,3,2);
(xi7xi6xi8xi2xi9xi1xi10xik) for i=1,2,3,4, k=5 & i=5,6,7,8, k=4;
(x1jx1kx2jx2kx3jx3kx4jx4k) for (j,k)=(2,10),(4,1),(6,3),(10,8);
(x5jx5kx6jx6kx7jx7kx8jx8k) for (j,k)=(1,4),(3,5),(5,10),(7,5),(8,10),(9,6).
4.1.2 An L8- decomposition of K8□K6
(x1jx1kx5jx7jx2jx2kx6jx8j), (x3jx3kx7jx1jx4jx4kx8jx2j) for (j,k)=(1,3),(5,2),(6,4);
(x1jx3jx5jx5kx2jx4jx6jx6k); (x3jx5jx7jx7kx4jx6jx8jx8k) for (j,k)=(2,5),(3,1),(4,6);
(xi1xk1xi2x9−i2xi3x9−i3xi4x9−i4) for (i,k)=(1,3),(2,4),(3,6);
(xi1xi+11xi5xk5xi3xi+13xi6xk6) for (i,k)=(1,8),(2,4),(3,5);
(xi1xi+11xi2xi+12xi3xi+13xi4xi+14) for i=4,5,6,7; (xi2xi+12xi4xi+14xi5xi+15xi6xi+16) for i=1,2,3;
(x81x51x82x52x83x53x84x54), (x41x11x45x65x43x13x46x66), (x51x31x55x65x53x73x56x66), (x61x41x65x75x63x83x66x76),
(x71x21x75x85x73x13x76x86), (x81x11x85x55x83x23x86x56), (x42x12x44x14x45x15x46x16), (x52x72x54x74x55x45x56x46),
(x62x82x64x84x65x35x66x36), (x72x12x74x14x75x25x76x26), (x82x22x84x24x85x15x86x16).
4.2 L8-decomposition required for Lemma 2.4
4.2.1 An L8- decomposition of K16□K9
(x1jx12jx2jx4jx15jx6jx16jx5j), (x3jx12jx4jx11jx13jx5jx14jx15j) for j=1,4,5,7,8;
(x5jx15jx6jx7jx11jx2jx12jx16j), (x7jx13jx8jx15jx9jx11jx10jx1j) for j=1,4,5,7,8;
(x1jx11jx13jx6jx2jx10jx14jx5j), (x3jx11jx15jx1jx4jx10jx16jx2j) for j=1,3,4,5,6,7,8;
(x1jx4jx7jx16jx2jx9jx8jx13j), (x9jx1jx15jx12jx10jx3jx16jx14j) for j=1,3,4,5,6,7,8,9;
(x1jx3jx5jx8jx2jx12jx6jx16j), (x9jx3jx13jx16jx10jx12jx14jx7j) for j=1,3,4,5,7,8;
(x7jx9jx11jx15jx8jx10jx12jx6j) for j=1,3,4,5,6,7,8; (x11jx16jx13jx15jx12jx4jx14jx8j) for j=1,3,4,5,7,8;
(x5jx7jx9jx12jx6jx8jx10jx11j) for j=1,2,3,4,5,6,7,8; (x1jx3jx5jx16jx2jx12jx6jx14j) for j=6,9;
(x3jx13jx7jx15jx4jx14jx8jx16j) for j=1,2,...,8,9; (xi3xi1xi7xi5xi4xi6xi9xi8) for i=1,2,...,15,16;
(xi9xi+29xi+49xi+45xi+19xi+39xi+59xi+55) for i=5,7; (xi1xi5xi8xi6xi2xi4xi9xi7) for i=1,2,...,7,8;
(xijx11jx12+ijx12+i5xi+1jx10jx13+ijx13+i5) for j=2,9 & i=1,3;
(x3jx2jx5jx11jx4jx9jx6jxkj) for j=1,3,4,5,7,8, k=14 & j=2,6,9, k=16;
(xi5xi4xi6xi1xi7xikxi8xi3) for i=1,2,...,7,8, k=2, & i=9,...,16, k=9;
(x5jx15jx6jx7jx11jx11kx12jx16j), (x11jx16jx13jx15jx12jx12kx14jx8j) for (j,k)=(6,3),(9,6);
(x7jx13jx8jx15jx9jx11jx10jx10k), (x3jx12jx4jx11jx13jx13kx14jx15j) for (j,k)=(2,7),(6,3),(9,6);
(x1jx12jx2jx4jx15jx15kx16jx16k) for (j,k)=(2,7),(3,5),(6,3),(9,6);
(xi3xk13xi+13xk23x16−i3x16−i5x17−i3x17−i5); for (i,k1,k2)=(3,12,11)(5,15,7),(7,13,15);
(x9jx9kx13jx16jx10jx12jx14jx14k) for (j,k)=(2,7),(6,3),(9,6);
(xi1xi7xi2xk2xi3xi6xi4xi8) for (i,k)=(1,10),(2,11),(3,9),(4,12),(5,13),(6,15),(7,14),(8,5);
(xi1xi7xi2xi6xi3xk3xi4xi8) for (i,k)=(9,11),(10,1),(11,2),(12,16),(13,5),(14,15),(15,6),(16,5);
(xi1xi5xi8xi6xi2xi4xi9xk9) for (i,k)=(9,12),(10,11),(11,15),(12,6),(13,6),(14,5),(15,1),(16,2);
(xi2xk12xi5xi3xi9xk29xi6xk26) for (i,k1,k2)=(1,15,10),(2,16,11),(3,10,9),(4,1,12),(5,14,13),(6,13,15),(7,6,14),(8,14,5);
(x72x92x112x152x82x102x122x125), (x12x92x72x162x22x122x82x132), (x92x95x152x122x102x105x162x112), (x112x115x132x152x122x127x142x162),
(x12x32x52x162x22x92x62x122), (x52x152x62x142x112x117x122x162).
4.2.2 An L8- decomposition of K16□K11
(x5jx15jx6jx7jx11jx2jx12jx16j), (x7jx13jx8jx15jx9jx11jx10jx1j) for j=1,2,4,5,7,8,10;
(x1jx11jx13jx6jx2jx10jx14jx5j), (x3jx11jx15jx1jx4jx10jx16jx2j) for j=2,5,6,7,8,9;
(x1jx4jx7jx16jx2jx9jx8jx13j), (x1jx3jx5jx8jx2jx12jx6jx16j) for j=1,2,4,5,...,10,11;
(x3jx13jx7jx15jx4jx14jx8jx16j), (x9jx3jx13jx16jx10jx12jx14jx7j) for j=1,2,3,5,...,11;
(xi3xi11xi7xi6xi4xi8xi10xi9), (xi2xi3xi5xi9xi7xi8xi11xi10) for i=1,2,5,6,7,8,10,11,12,14;
(xi2xi1xi5xi9xi7xi8xi11xi10), (xi1xi3xi6xi5xi2xi4xi7xi10) for i=15,16;
(xi3xi5xi4xi6xi9xi11xi8xi10), (xi3xi11xi7xi6xi4xi8xi10xk9) for i=15,16;
(x1jx1kx2jx2kx15jx6jx16jx5j), (x3jx3kx4jx4kx13jx13kx14jx14k) for (j,k)=(6,3),(9,3),(11,8);
(x5jx5kx6jx6kx11jx11kx12jx12k), (x7jx7kx8jx8kx9jx9kx10jx10k) for (j,k)=(6,3),(9,3),(11,8);
(x1jx12jx2jx4jx15jx6jx16jx5j) for j=2,5,7,8,10; (x3jx2jx5jx11jx4jx9jx6jx14j) for j=1,2,4,5,...,10,11;
(x5jx7jx9jx12jx6jx8jx10jx11j) for j=2,3,...,10,11; (x9jx1jx15jx12jx10jx3jx16jx14j) for j=6,7,8,9;
(x3jx12jx4jx11jx13jx5jx14jx15j) for j=1,2,3,4,5,7,8,10;
(xi1xi4xi8xi6xi2xi10xi9xi7) for i=1,2,5,6,12,14,15,16;
(x7jx9jx11jx15jx8jx10jx12jx6j) for j=1,2,4,5,...,11; (xi5xk5xi10xi1xi6xi9xi11xi8) for (i.k)=(15,12),(16,14);
(x9jx9kx15jx12jx10jx3jx16jx14j) for (j,k)=(1,10),(4,1),(10,11),(11,3);
(x3jx3kx15jx1jx4jx4kx16jx2j) for (j,k)=(10,11),(11,3); (x11jx16jx13jx15jx12jx4jx14jx8j) for j=1,2,3,5,...,11;
(x1jx12jx2jx4jx15jx15kx16jx16k) for (j,k)=(1,11),(3,9),(4,5);
(x1jx11jx13jx13kx2jx10jx14jx5j) for (j,k)=(4,1),(10,11),(11,3);
(x3jx3k1x15jx15k2x4jx4k1x16jx16k2) for (j,k1,k2)=(1,10,5),(4,1,11);
(xi1xi3xi6xk6xi2xi4xi7xi10) for (i,k)=(1,12),(2,4),(3,12),(4,11),(5,15),(6,7),(7,13),(8,15),(9,11),(10,1),(11,2),(13,5);
(xi1xi3xi6xk16xi2xk22xi7xi10) for (i,k1,k2)=(12,16,15),(14,15,16);
(xi3xi5xi4xi6xi9xk9xi8xi10) for (i,k)=(1,12),(2,4),(3,12),(4,11),(5,15),(6,7),(7,13),(8,15),(9,11),(10,1),(11,2),(12,16),(13,5),(14,15);
(xi5xi8xi10xi1xi6xi9xi11xk11) for (i,k)=(1,12),(2,4),(5,15),(6,7),(7,13),(8,15),(10,1),(11,2),(12,16),(14,15);
(xi5xi8xi10xk110xi6xi9xi11xk211) for (i,k1,k2)=(3,11,12),(4,10,11),(9,1,11),(13,6,5);
(xi1xk1xi8xi6xi2xi10xi9xi7) for (i,k)=(3,11),(4,10),(7,5),(8,6),(9,1),(10,2),(11,1),(13,6);
(xi3xk3xi7xi6xi4xi8xi10xi9) for (i,k)=(3,10),(4,1),(9,2),(13,7);
(xi2xi3xi5xi9xi7xi8xi11xk11) for (i,k)=(3,11),(4,10),(9,1),(13,6);
(xi1xi2xi5xi6xi4xk4xi11xi9) for (i,k)=(1,15),(2,16),(3,11),(4,10),(5,16),(6,15),(7,15),(8,16),(9,1),(10,12),(11,16),(12,4),(13,6),(14,8);
(x53x153x63x143x113x23x123x163), (x73x63x83x153x93x113x103x13), (x11x151x131x1310x21x161x141x51), (x13x113x133x63x23x163x143x53),
(x33x113x153x156x43x103x163x166), (x73x93x113x153x83x53x123x63), (x51x161x91x121x61x151x101x111), (x33x23x53x113x43x93x63x163),
(x13x153x73x163x23x103x83x133), (x92x12x152x153x102x32x162x163), (x93x13x153x123x103x83x163x143), (x114x111x134x154x124x122x144x142),
(x34x134x74x71x44x144x84x81), (x13x33x53x163x23x123x63x153), (x94x34x134x164x104x101x144x74), (x95x15x155x158x105x35x165x168).
4.2.3 An L8- decomposition of K16□K13
(x1jx12jx2jx4jx15jx6jx16jx5j), (x3jx2jx5jx11jx4jx9jx6jx14j), for j=2,…,8,10,…,13;
(x5jx15jx6jx7jx11jx2jx12jx16j), (x7jx13jx8jx15jx9jx11jx10jx1j) for j=1,…,13;
(x1jx4jx7jx16jx2jx9jx8jx13j), (x5jx7jx9jx12jx6jx8jx10jx11j) for j=1,…,13;
(x1jx11jx13jx6jx2jx10jx14jx5j), (x3jx11jx15jx1jx4jx10jx16jx2j) for j=2,…,6,8,10,12,13;
(x9jx1jx15jx12jx10jx3jx16jx14j), (x11jx16jx13jx15jx12jx4jx14jx8j) for j=2,…6,8,10,12,13;
(x7jx9jx11jx15jx8jx10jx12jx6j), (x1jx3jx5jx8jx2jx12jx6jx16j) for j=1,…,6,8,9,10,12,13;
, (xi1xi5xi7xi4xi2xi6xi8xi3), (xi4xi2xi5xi3xi7xi10xi6xi1) for i=1,2,...,16;
(xi1xi4xi2xi12xi10xi6xi9xi5), (xi5xi2xi6xi3xi13xi11xi10xi12), for i=1,2,...,16;
(x7jx14jx11jx15jx8jx10jx12jx6j), (x1jx11jx13jx6jx2jx16jx14jx5j), for j=7,11;
(xi3xi13xi4xi11xi8xi5xi7xi9), (xi2xi13xi3xi1xi12xi8xi11xi10), for i=1,2,5,6,7,8,11,…,16;
(x3jx3k1x4jx4k1x13jx13k2x14jx15j), (x9jx9k1x13jx16jx10jx10k1x14jx14k2) for (j,k1,k2)=(1,10,12),(9,7,13);
(x3jx11jx15jx13jx4jx10jx16jx16k), (x11jx16jx13jx13kx12jx15jx14jx8j) for (j,k)=(7,13),(11,8);
(xi3xi13xi4xi11xi8xi5xi7xk7), (xi2xi13xi3xi1xi12xi8xi11xk11) for (i,k)=(3,1),(4,12),(9,7),(10,2);
(x3jx2jx5jx13jx4jx9jx6jx14j) for j=1,9; (x1jx12jx2jx4jx15jx6jx16jx16k) for (j,k)=(1,12),(9,11);
(x3jx13jx7jx15jx4jx14jx8jx16j) for j=1,…,13; (x11jx16jx13jx15jx12jx4jx14jx14k) for (j,k)=(1,11),(9,11);
(x1jx15jx5jx8jx2jx12jx6jx16j) for j=7,11; (x9jx3jx13jx16jx10jx12jx14jx7j) for j=2,…,6,8,12,13;
(x3jx12jx4jx11jx13jx5jx14jx15j) for j=2,…,8,11,12,13;
(x9jx3jx13jx16jx10jx12jx14jx14k) for (j,k)=(7,13),(11,8);
(x9jx1jx15jx15kx10jx3jx16jx14j) for (j,k)=(1,12),(7,13),(9,13),(11,8);
(xi3xi11xi9xi2xi4xikxi10xi1) for i=1,2,5,6,7,8,11,12, k=12 & i=13,14,15,16 k=13;
(xi3xi11xi9xi2xi4xi12xi10xk10) for (i,k)=(3,12),(4,11),(9,3),(10,12);
(xi5xi13xi11xi7xi6xi8xi12xik) for i=1,2,...,12, k=1 & i=13,14,15,16 k=4;
(xi8xi10xi9xi6xi12xi7xi13xik) for i=1,2,...,12, k=4 & i=13,14,15,16 k=1;
(xi1xk1xi11xi8xi9xk9xi13xi7) for (i,k)=(1,15),(2,16),(3,12),(4,11),(5,16),(6,13),(7,14),
(8,14),(9,3),(10,12),(11,5),(12,15);
(x310x311x410x411x1310x510x1410x1510), (x11x111x131x1311x21x101x141x51), (x19x119x139x1311x29x109x149x59), (x31x111x151x1511x41x101x161x1611),
(x39x119x159x1511x49x109x169x1613), (x910x911x1310x1610x1010x1011x1410x710).
4.2.4 An L8- decomposition of K16□K7
(x1jx1kx2jx2kx15jx15kx16jx16k), (x3jx3kx4jx4kx13jx13kx14jx14k) for (j,k)=(1,4),(2,3),(3,6),(4,3),(5,6),
(6,2),(7,6);
(x1jx11jx13jx6jx2jx10jx14jx5j), (x1jx4jx7jx16jx2jx9jx8jx13j) for j=1,3,6,7;
(x1jx4jx7jx16jx2jx11jx8jx13j) for j=4,5; (x7jx9jx11jx15jx8jx10jx12jx6j) for j=1,3,4,6;
(x9jx1jx15jx12jx10jx3jx16jx14j) for j=1,6; (x5jx7jx9jx12jx6jx8jx10jx11j) for j=1,4,6,7;
(x11jx16jx13jx15jx12jx4jx14jx8j) for j=1,6; (x3jx13jx7jx15jx4jx14jx8jx16j) for j=1,2,4,5,6;
(x3jx10jx7jx15jx4jx14jx8jx16j) for j=3,7; (x1jx3jx5jx8jx2jx12jx6jx16j) for j=1,3,4,5,6,7;
(x3jx11jx15jx1jx4jx10jx16jx2j) for j=1,6,7; (x1jx11jx13jx13kx2jx10jx14jx5j) for (j,k)=(2,5),(4,7),(5,4);
(x3jx2jx5jx11jx4jx9jx6jx14j) for j=1,...,7; (x3jx11jx15jx15kx4jx10jx16jx16k) (j,k)=(2,5),(4,7),(5,4);
(x9jx3jx13jx16jx10jx12jx14jx7j) for j=1,3,4,5,6,7;
(x7jx7kx8jx8kx9jx9kx10jx10k) for (j,k)=(1,4),(5,6),(6,2),(7,6);
(x7jx7k1x8jx8k2x9jx9k2x10jx10k2) for (j,k1,k2)=(2,4,3),(3,4,6),(4,6,3);
(x9jx1jx15jx12jx10jx10kx16jx14j) for (j,k)=(3,7),(4,7),(5,2),(7,2);
(x5jx5kx6jx6kx11jx11kx12jx12k) for (j,k)=(1,4),(4,3),(5,6),(7,6);
(xi1xk1xi3xk3xi5xk5xi7xk7) for (i,k)=(1,12),(2,4),(3,12),(4,11),(8,15),(9,11),(10,1),
(12,16),(13,5);
(xi1xi5xi2xk2xi4xk4xi6xk6) for (i,k)=(1,12),(2,4),(3,12),(4,11),(5,15),(8,15),(12,16),
(14,15);
(xi2xk2xi5xk5xi4xk4xi7xi3) for (i,k)=(1,15),(2,16),(4,12),(5,16),(6,13),(8,14),(9,2);
(x52x72x62x63x112x113x122x123), (x53x56x63x66x113x116x123x127), (x56x52x66x62x116x112x126x123), (x33x113x153x13x43x103x163x167),
(x72x162x112x117x82x62x122x127), (x75x95x115x155x85x105x125x122), (x77x97x117x113x87x107x127x67), (x52x132x92x112x62x122x102x12),
(x53x163x93x123x63x83x103x113), (x55x75x95x125x65x85x105x104), (x12x42x72x62x22x112x82x102), (x92x72x152x122x102x32x162x142),
(x112x162x132x152x122x126x142x145), (x113x163x133x73x123x43x143x147), (x114x115x134x154x124x127x144x147), (x115x105x135x155x125x124x145x144),
(x117x167x137x132x127x47x147x87), (x12x92x52x82x22x122x62x162), (x92x32x132x162x102x122x142x147), (x51x151x53x52x55x155x57x157),
(x61x71x63x153x65x125x67x77), (x71x131x73x53x75x135x77x137), (x111x21x113x23x115x112x117x27), (x141x151x143x83x145x155x147x157),
(x151x61x153x53x155x65x157x67), (x161x51x163x23x165x115x167x57), (x61x65x62x152x64x74x66x76), (x91x95x92x122x94x114x96x116),
(x101x105x102x112x104x14x106x16), (x111x115x112x152x114x117x116x26), (x131x135x132x82x134x54x136x56), (x151x155x152x157x154x64x156x66),
(x161x165x162x167x164x114x166x56), (x32x12x35x105x34x104x37x33), (x72x142x75x65x74x134x77x73), (x71x75x72x132x73x63x76x136),
(x133x33x137x37x157x117x153x143).
4.3 L8-decomposition required for Lemma 2.6
4.3.1 An L8- decomposition of K19\K3
Let V(K19)={x1,x2,...,x19} and the K3 be (x13x15x17).
(x1x9x2x12x18x5x19x6), (x3x9x4x1x16x18x17x19), (x5x3x6x4x14x16x15x1), (x7x9x8x2x12x16x13x14), (x9x4x10x16x11x7x12x17), (x1x12x16x3x2x9x17x4), (x3x10x18x1x4x2x19x12), (x5x11x12x18x6x3x13x16), (x7x2x14x17x8x1x15x3), (x1x14x10x13x2x19x11x3), (x3x1x12x7x4x11x13x2), (x1x13x5x14x2x15x6x11),
(x7x6x16x19x8x5x17x11), (x9x11x18x6x10x4x19x5), (x11x13x14x2x12x10x15x4), (x3x2x7x1x4x14x8x9),
(x5x7x16x9x6x8x17x18), (x9x13x14x3x10x17x15x16), (x11x16x18x14x13x8x19x15), (x5x4x9x17x6x15x10x8),
(x7x10x18x15x8x11x19x14).
4.3.2 An L8- decomposition of K16□K3
(x1jx12jx2jx4jx15jx6jx16jx5j), (x3jx11jx15jx1jx4jx10jx16jx2j), (x11jx16jx13jx15jx12jx4jx14jx8j) for j=1,2,3;
(x5jx15jx6jx7jx11jx2jx12jx16j), (x1jx11jx13jx6jx2jx10jx14jx5j) for j=1,3;
(x5jx7jx9jx12jx6jx8jx10jx101) for j=2,3;
(x7jx13jx8jx15jx9jxk1k2x10jx1j) for (j,k1,k2)=(1,9,3),(2,9,3),(3,11,3);
(x7jx9jx11jx15jx8jxk1k2x12jx6j) for (j,k1,k2)=(1,10,1),(2,10,2),(3,8,1);
(x3jx2jx5jxk1k2x4jx9jx6jx14j) for (j,k1,k2)=(1,11,1),(2,11,2),(3,5,2);
(x9jx1jx15jxk1k2x10jx3jx16jx14j) for (j,k1,k2)=(1,12,1),(2,15,3),(3,12,3);
(x3jx13jx7jx15jx4jxk1k2x8jx16j) (j,k1,k2)=(1,4,3),(2,4,1),(3,14,3);
(x9jx3jx13jxk1k2x10jx12jx14jx7j) for (j,k1,k2)=(1,16,1),(2,13,1),(3,13,1);
(x31x33x41x111x131x51x141x143), (x32x33x42x43x132x52x142x143), (x33x123x43x113x133x53x143x153), (x52x51x62x61x112x22x122x123),
(x12x11x132x62x22x21x142x52), (x51x53x91x121x61x81x101x111), (x11x41x71x73x21x23x81x82), (x12x42x72x73x22x23x82x83),
(x13x43x73x163x23x93x83x133), (x11x13x51x81x21x121x61x161), (x12x13x52x82x22x122x62x63), (x13x33x53x83x23x123x63x61),
(x31x11x121x123x122x152x32x12), (x141x41x151x153x152x52x142x42), (x91x21x111x113x112x12x92x22), (x102x22x112x42x113x53x103x83),
(x71x51x161x163x162x122x72x62), (x132x82x162x62x163x63x133x83).
4.3.3 An L8- decomposition of K15□K3
(x7jx15jx8jx14jx9jx1jx10jx5j) for j=2,3; (x5jx14jx13jx4jx6jx7jx15jx2j) for j=1,2,3;
(x3jx8jx11jx6jx9jx15jx12jx10j) for j=1,3; (x1jx4jx12jxkjx2jx7jx13jx14j) for (j,k)=(1,15),(2,5),(3,15);
(x10jx15jx13jx8jx11jxkjx14jx1j) for (j,k)=(1,4),(2,12),(3,4);
(x3jx10jx7jx13jx4jxkjx9jx14j) for (j,k)=(1,5),(2,8),(3,8);
(x11x71x21x81x141x121x151x153), (x12x13x22x82x142x143x152x153), (x13x73x23x83x143x141x153x133), (x31x33x41x43x121x51x131x91),
(x32x33x42x43x122x142x132x133), (x33x13x43x23x123x53x133x93), (x51x31x61x62x101x21x111x151), (x52x32x62x42x102x103x112x113),
(x53x33x63x43x103x23x113x153), (x71x73x81x141x91x11x101x51), (x31x21x141x142x41x101x151x81), (x32x22x142x72x42x102x152x122),
(x33x23x143x73x43x103x153x83), (x51x52x81x11x61x63x91x21), (x52x42x82x12x62x63x92x93), (x53x43x83x13x63x33x93x23),
(x71x141x111x11x81x83x121x61), (x72x73x112x12x82x83x122x62), (x73x93x113x13x83x103x123x63), (x11x101x51x53x21x111x61x141),
(x12x102x52x53x22x112x62x142), (x13x103x53x73x23x22x63x143), (x32x82x112x62x92x152x122x123),
(x111x112x121x122x123x143x113x23), (x11x13x31x61x32x62x12x72), (x21x23x41x61x42x112x22x102),
(x71x51x91x93x92x22x72x52), (x81x41x101x103x102x122x82x152), (x131x133x151x71x152x112x132x92).
4.4 L8-decomposition required for Lemma 2.7
4.4.1 An L8- decomposition of K16□K5
(x1jx15x2jx25x15jx155x16jx165), (x3jx35x4jx45x13jx135x14jx145) for j=1,2,3,4;
(x9jx3jx13jx16jx10jx12jx14jx7j), (x5jx7jx9jx12jx6jx8jx10jx11j) for j=1,2,5;
(x5jx55x6jx65x11jx115x12jx125), (x7jx75x8jx85x9jx95x10jx105) for j=1,2,3,4;
(x12jx2jx15jx8jx15kx14kx12kx9k), (x11jx4jx16jx6jx16kx13kx11kx10k) for (j,k)=(1,3),(2,4);
(x7jx9jx11jx15jx8jx10jx12jx6j), (x1jx4jx7jx16jx2jx9jx8jx13j) for j=1,2,3,4,5;
(x1jx3jx5jx8jx2jx12jx6jx16j) for j=3,4,5; (x3jx13jx7jx7kx4jx14jx8jx16j) for (j,k)=(3,1),(4,2);
(x1jxk1k2x13jx6jx2jx10jx14jx5j) for j=k2=3,4,5,k1=11&(j,k1,k2)=(1,1,3),(2,1,4);
(x3jxk1k2x15jx1jx4jx10jx16jx2j) for j=k2=1,2,5,k1=11&(j,k1,k2)=(3,3,1),(4,3,2);
(x3jx2jx5jx11jx4jxk1k2x6jx14j) for j=k2=3,4,5,k1=9&(j,k1,k2)=(1,4,3),(2,4,4);
(x9jx1jx15jxkjx10jx3jx16jx14j) for (j,k)=(1,5),(2,5),(3,7),(4,7);
(x11jxkjx13jx15jx12jx4jx14jx8j) for (j,k)=(1,1),(2,1),(3,3),(4,3);
(x3jx13jx7jx15jx4jx14jx8jx8k) for (j,k)=(1,3),(2,4);
(xi1xk1xi2xk2xi3xk3xi4xk4) for (i,k)=(1,12),(2,4),(3,12),(6,7)(7,13),(9,11),(10,1),(11,2),(12,16),(13,5),(15,6),(16,5);
(xi1xk11xi2xk12xi3xk23xi4xk24) for (i,k1,k2)=(4,9,11),(5,8,15),(8,16,15),(14,15,7);
(x15x125x25x45x155x65x165x55), (x35x125x45x115x135x55x145x155), (x55x155x65x75x115x25x125x165), (x75x135x85x155x95x115x105x15),
(x53x73x93x91x63x83x103x101), (x54x74x94x92x64x84x104x102), (x95x15x155x125x105x35x165x145), (x115x165x135x155x125x45x145x85),
(x35x135x75x155x45x145x85x165), (x11x31x51x53x21x23x61x63), (x12x32x52x54x22x24x62x64), (x93x33x133x131x103x123x143x141),
(x94x34x134x132x104x124x144x142).
4.4.2 An L8- decomposition of K13□K5
(x5jx3jx9jx93x6jx4jx10jx103), (x3jx11jx12jx2jx4jx9jx13jx7j) for j=2,4;
(x7jx9jx8jx2jx10jx1jx11jx13j) for j=1,5; (x1jx7jx13jx133x8jx9jx12jx123) for j=2,5;
(x9jx8jx12jx6jx10jx4jx13jx5j) for j=3,4; (xi1xk1xi2xk2xi4xk4xi3xk3) for (i,k)=(5,7),(8,11);
(x1jxk1jx5jx5k2x2jx2k2x6jx6k2) for (j,k1,k2)=(1,9,4),(2,8,5),(3,9,2);
(xi1xk11xi2xk22xi5xk15xi4xk24) for (i,k1,k2)=(9,10,11),(10,2,1),(13,6,6);
(x14x15x54x55x24x114x64x65), (x15x13x55x53x25x23x65x63), (x31x33x71x75x41x43x81x84), (x32x12x72x74x42x43x82x85),
(x33x93x73x13x43x23x83x82), (x34x32x74x73x44x43x84x85), (x35x33x75x55x45x115x85x83), (x51x55x91x93x61x121x101x103),
(x53x33x93x73x63x43x103x13), (x55x135x95x93x65x61x105x103), (x11x21x41x61x51x81x111x113), (x12x22x42x44x52x82x112x115),
(x13x14x43x133x53x83x113x63), (x14x24x44x34x54x84x114x111), (x15x25x45x65x55x85x115x35), (x21x111x31x41x61x51x71x131),
(x22x112x32x42x62x52x72x102), (x23x113x33x32x63x53x73x103), (x24x94x34x14x64x54x74x104), (x25x115x35x45x65x55x75x73),
(x72x92x82x22x102x32x112x42), (x73x72x83x13x103x33x113x114), (x74x94x84x14x104x34x114x44), (x11x71x131x133x81x91x121x51),
(x13x33x133x63x83x23x123x73), (x14x74x134x133x84x24x124x123), (x31x111x121x21x41x45x131x135), (x33x113x43x93x123x53x133x73),
(x35x15x125x25x45x43x135x75), (x91x111x121x123x101x41x131x51), (x92x22x122x62x102x42x132x52), (x95x115x125x65x105x45x135x25),
(x11x31x13x23x12x15x14x94), (x21x41x22x132x24x134x23x103), (x31x91x32x92x35x95x34x33), (x41x111x42x22x45x25x44x24),
(x61x111x62x82x64x84x63x83), (x71x73x72x122x75x125x74x124), (x112x62x113x133x115x65x114x64), (x121x71x122x112x125x55x124x114),
(x21x131x25x24x95x45x91x41), (x92x12x94x34x104x24x102x22), (x111x112x115x85x125x135x121x131), (x122x52x124x54x134x114x132x112),
(x23x133x93x103x113x43x123x33), (x31x51x35x55x105x75x101x71), (x11x12x15x95x85x65x81x61).
4.5 L8-decomposition required for Lemma 2.8
4.5.1 An L8- decomposition of K11□K7
(x1jx9jx5jx7jx2jx4jx6jx8j) for j=2,5; (x1jx3jx4jx9jx5jx8jx11jx11k) for (j,k)=(2,3),(3,4);
(x5jx3jx9jx11jx6jx4jx10jx1j) for j=5,6; (x7jx9jx8jx1jx10jx2jx11jx4j) for j=1,2,5;
(x2jx1jx3jx11jx6jx5jx7jx7k) for (j,k)=(5,2),(6,2);
(x7jx9jx8jx1jx10jx10kx11jx4j) for (j,k)=(3,6),(6,7);
(xi1xi4xi3xi2xi5xi6xi7xk7) for (i,k)=(5,9),(6,8),(7,1),(8,9);
(xi1xk11xi3xi2xi5xi6xi7xk27) for (i,k1,k2)=(1,9,9),(4,3,3),(9,8,2);
(xi1xi5xi2xk2xi4xi3xi6xi7) for (i,k)=(4,3),(8,9),(9,2);
(xi2xi6xi5xk5xi4xk4xi7xi3) for (i,k)=(3,10),(8,9);
(x11x101x51x31x21x91x61x81), (x13x93x53x73x23x103x63x113), (x14x11x54x104x24x21x64x84), (x16x13x56x53x26x22x66x63),
(x17x16x57x56x27x26x67x117), (x31x111x71x11x41x101x81x21), (x32x92x72x12x42x102x82x22), (x33x53x73x13x43x103x83x23),
(x34x33x74x14x44x94x84x24), (x35x95x75x15x45x105x85x55), (x36x96x76x73x46x106x86x56), (x37x57x77x76x47x67x87x27),
(x51x81x91x111x61x41x101x104), (x52x32x92x112x62x42x102x103), (x53x57x93x96x63x43x103x13), (x77x97x87x17x107x27x117x37),
(x11x31x41x91x51x71x111x81), (x14x34x44x104x54x84x114x94), (x15x35x45x95x55x52x115x65), (x16x31x46x96x56x52x116x112),
(x17x37x47x27x57x87x117x116), (x21x111x31x91x61x51x71x101), (x22x12x32x33x62x52x72x102), (x23x13x33x93x63x53x73x103),
(x24x14x34x114x64x94x74x104), (x27x23x37x97x67x57x77x107), (x21x41x23x24x25x85x27x117), (x31x101x33x43x35x36x37x107),
(x101x91x103x33x105x75x107x97), (x111x114x113x93x115x116x117x87), (x11x21x12x102x14x13x16x96), (x21x25x22x112x24x94x26x86),
(x31x35x32x102x34x94x36x37), (x51x55x52x57x54x53x56x76), (x61x111x62x112x64x63x66x86), (x71x75x72x77x74x73x76x16),
(x101x105x102x92x104x103x106x76), (x111x115x112x82x114x104x116x66), (x12x16x15x11x14x94x17x13), (x22x23x25x115x24x114x27x17),
(x42x46x45x35x44x41x47x43), (x26x25x46x43x36x33x106x105), (x62x66x65x61x64x114x67x63), (x92x96x95x25x94x91x97x117),
(x102x106x105x95x104x14x107x103), (x112x32x115x85x114x84x117x113), (x23x43x93x103x83x63x113x33), (x26x23x96x106x86x83x116x113)
(x34x31x44x41x64x104x54x94), (x74x114x84x14x104x24x94x44), (x47x117x97x93x67x66x107x17), (x54x55x74x75x77x73x57x107).
4.6 L8-decomposition required for Lemma 2.9
4.6.1 An L8- decomposition of K9□K9
(x1jx7jx2jx5jx3jx6jx4jx8j) for j=4,6,7,8; (x5jx4jx6jx1jx7jx2jx8jx3j) for j=1,2,4,5,6,7,8;
(xi1xi7xi2xi5xi3xi6xi4xi8) for i=2,4,6; (x1jx5jx8jx6jx2jx4jx9jx7j) for j=1,2,3,4,7,8,9;
(xi1xi7xi2xi6xi3xk3xi4xi8) for (i,k)=(1,7),(7,2); (xi1xi7xi2xk2xi3xi6xi4xi8) for (i,k)=(3,5),(8,4);
(xi1xk1xi2xi5xi3xi6xi4xk4) for (i,k)=(5,3),(9,6); (xi5xi4xi6xi1xi7xi2xi8xi3) for i=1,3,4,6,7,8;
(xi1xi5xi8xi6xi2xi4xi9xi7) for i=1,3,…,9; (xi3xi1xi7xi5xi4xi6xi9xi8) for i=1,3,4,5,7,8,9;
(x3jx1jx7jx5jx4jx6jx9jx8j) for j=1,2,3,4,6,7,8,9;
(x11x71x21x25x31x61x41x81), (x12x72x22x52x32x62x42x46), (x13x16x23x28x33x63x43x83), (x15x13x25x27x35x65x45x43),
(x19x16x29x59x39x69x49x46), (x53x43x63x13x73x76x83x85), (x59x55x69x99x79x29x89x39), (x15x55x85x65x25x23x95x75),
(x16x56x86x82x26x46x96x76), (x35x15x75x72x45x65x95x85), (x25x24x26x21x27x22x28x68), (x55x75x56x51x57x52x58x53),
(x95x55x96x99x97x92x98x93), (x21x61x28x26x22x24x29x27), (x23x21x27x67x24x26x29x28), (x63x61x67x65x64x24x69x68),
(x62x22x66x86x96x56x92x52), (x63x23x65x25x95x99x93x53), (x54x55x58x38x98x68x94x95), (x51x21x57x37x97x67x91x96),
(x36x32x39x35x59x99x56x52), (x33x83x35x32x55x25x53x23), (x26x22x29x25x69x65x66x64), (x15x12x19x69x79x76x75x73),
(x45x25x49x59x89x86x85x82).