Strong edge coloring of Cayley graphs and some product graphs

A strong edge coloring of a graph $G$ is a proper edge coloring of $G$ such that every color class is an induced matching. The minimum number of colors required is termed the strong chromatic index. In this paper, we determine the exact value of the strong chromatic index of all unitary Cayley graphs. Our investigations reveal an underlying product structure from which the unitary Cayley graphs emerge. We then go on to give tight bounds for the strong chromatic index of the Cartesian product of two trees, including an exact formula for the product in the case of stars. Further, we give bounds for the strong chromatic index of the product of a tree with a cycle. For any tree, those bounds may differ from the actual value only by not more than a small additive constant (at most 2 for even cycles and at most 5 for odd cycles), moreover they yield the exact value when the length of the cycle is divisible by $4$.


Introduction
Throughout the paper, an edge joining vertices u and v is denoted by (u, v). Let G be a simple, finite, undirected graph. A proper edge coloring is a map c from the edge set of G to a set of distinct colors such that for any two edges (u, v) and (v, w), c((u, v)) = c((v, w)). In addition, if c((u, v)) = c((w, x)) whenever (v, w) is an edge, then c is called a strong edge coloring. That is, a strong edge coloring is a proper edge coloring in which the vertex set of every color class induces a matching. The strong chromatic index of G, denoted by χ ′ s (G), is the minimum number of colors needed for any strong edge coloring of G.
There are several ways to look at this type of coloring. Namely, the following conditions are equivalent: (a) each color class is an induced matching, (b) each P 4 ⊂ G is 3-edge-colored, (c) the square (L(G)) 2 of the line graph of G is properly vertex-colored, (d) the coloring is 1-intersection edge coloring 1 of G. The notion was introduced by Fou-quet and Jolivet [18] with the intention to represent conflict-free channel assignment in some radio networks.
There are many interesting conjectures on this problem. Among them the most famous one is Erdős and Nešetřil's conjecture, which states that the strong chromatic index of any graph G is at most (5∆ 2 − 2∆ + 1)/4 if ∆ is odd, and at most 5∆ 2 /4 if ∆ is even. Here ∆ = ∆(G) denotes the maximum degree of the graph G. As mentioned in [16], the conjecture was raised at the end of 1985; the first publication proposing the bound 5∆ 2 /4 seems to be [15]. If the bounds are valid, then they are tight, as shown by the graph obtained from the 5-cycle by substituting independent sets of size ∆/2 into its vertices if ∆ is even (inserting a complete bipartite graph between any two consecutive sets along the cycle), or two consecutive sets of size (∆ + 1)/2 and three others of size (∆ − 1)/2 if ∆ is odd.
Since there are well over a hundred papers dealing with the strong chromatic index, here we necessarily are limited to a partial survey only. The conjecture is proved by Chung et al. [12] for all ∆ for the restricted class of graphs in which any two disjoint edges are joined by an edge (this particular case was conjectured already in 1983 by Bermond et al. [5], also raised independently in [15]).
For small ∆, Andersen [3] and Horák et al. [20] showed that every cubic graph G satisfies χ ′ s (G) ≤ 10. (The case of non-regular sub-cubic graphs is easy, as noted in [17]). The case of ∆ = 4 is already complicated, the upper bound of 20 (respectively 19,18,17,16) is known to be valid only under the further assumption that the maximum average degree is at most 51/13 (respectively 15/4, 18/5, 7/2, 61/18) [30]. These are improvements of the estimates in [4], where e.g. the sufficiency of maximum average degree at most 19/5 for 20-colorability was proved. The currently best result without average-degree restrictions states χ ′ s (G) ≤ 21, achieved only recently by Huang et al. [22]. Since each edge is strongly independent from all but at most 24 other edges, the upper bound 25 is very easy. Improving this bound to 24, follows in one step from a general theorem of [12] quoted above, applying Brooks's theorem. This was further improved to 23 by Horák [19], to 22 by Cranston [13], and finally to 21 by Huang et al. [22]. Bruhn and Joos [9] proved that χ ′ s (G) ≤ 1.93∆ 2 (G), for graphs of sufficiently large maximum degree. This improves an old bound of χ ′ s (G) ≤ 1.998∆ 2 (G) proved by Molloy and Reed [32]. This bound is further improved for graphs with sufficiently large maximum degree. Hurley, Verclos and Kang showed that the strong chromatic index is atmost 1.772∆ 2 (G), for any graph G with sufficiently large maximum degree ∆(G) [25].
In 1989, Faudree et al. [16] conjectured that every bipartite graph G satisfies χ ′ s (G) ≤ (∆(G)) 2 . Brualdi and Quinn Massey strengthened this conjecture to state that if G is a bipartite graph with bipartition (A, B) and ∆(A) and ∆(B) are the maximum degrees of the vertices in A and B respectively, then χ ′ s (G) ≤ ∆(A)∆(B) holds [8]. Later, Nakprasit [34] proved that this conjecture is valid when ∆(A) = 2. That is, for a (2, ∆)-bipartite graph there is a strong edge coloring that uses at most 2∆ colors. In 2017, Huang et al. [23] showed that if G is a (3, ∆)-bipartite graph, then χ ′ s (G) ≤ 3∆. Bipartite graphs are complex also in the algorithmic sense: Mahdian [31] showed that determining the exact value of the strong chromatic index is NP-hard even for bipartite graphs with girth at least g, for any natural number g.
It is known that every planar graph admits a 4∆ + 4 strong edge coloring [17]. Moreover, 3∆ + 5 colors are sufficient if the planar graph has girth 6, and if it has girth at least 7 then even 3∆ colors are sufficient [24]. Furthermore for outerplanar graphs an exact formula can be given, as shown in the following theorem.
Theorem 1.1 [7] Let G be an outerplanar graph. Then χ ′ s (G) = max{max The exact values for the puffer graphs are obtained in [11]. A Halin graph is a plane graph constructed from a tree T without vertices of degree two by connecting all leaves through a cycle C. Let G = T ∪ C be a Halin graph. Lai et al. [28] proved that χ ′ s (G) ≤ χ ′ s (T ) + 3, provided G is different from some special graphs. Also it is known that every Halin graph G with ∆(G) ≥ 4 satisfies χ ′ s (G) ≤ 2∆(G) + 1 [21]. Moreover, apart from two exceptions, cubic Halin graphs have χ ′ s (G) ≤ 7 [29]. We first discuss the strong edge coloring of the class of graphs called unitary Cayley graph. Let U n be the set of all units of Z n , that is U n = {m ∈ Z n | gcd(m, n) = 1}. For any natural number the Cayley graph Cay(Z n , U n ) is called a unitary Cayley graph and is denoted by X n . Now for any m ∈ Z n , gcd(m, n) = 1 if and only if gcd(−m, n) = 1, and every element of U n generates Z n . Hence, X n is an undirected connected (and also Hamiltonian) graph.
The structure and various properties of unitary Cayley graphs have been studied in the literature (see [6], [27]). For a natural number n, X n is a φ(n)-regular graph, where φ is Euler's phi function. It is known that a unitary Cayley graph is bipartite if and only if n is even [14]. Akhtar et al. [1] showed that the chromatic index of X n is φ(n) + 1 if n is odd, and it is φ(n) otherwise.
Here we determine exactly the strong chromatic index of Cayley graphs X n , for all n. Namely, we prove that if a given natural number n has k distinct prime factors in its prime factor decomposition, then χ ′ s (X n ) = |E|/2 k−1 . Besides the unitary Cayley graphs we also discuss about the Cartesian product of graphs. Cartesian product of graphs is an important notion in the theory of graph products, where the structure of the factors (graphs) appears as an induced subgraph. For several important results and properties of the Cartesian product see the book [26]. Here we concentrate on the Cartesian product of certain classes of graphs. The first result in the literature concerning strong chromatic index under the product operation was given in [17] where the exact value for the n-dimensional hypercube was proven to be χ ′ s (Q n ) = 2n for all n ≥ 2. The systematic study of χ ′ s on various types of graph products was initiated by Togni in [35]; in particular, he determined formulas for the Cartesian products of paths and cycles. Complexity issues and general inequalities for some product types have also been presented by Chalermsook et al. in [10].
Here we give both upper and lower bounds for the strong chromatic index of the Cartesian product of any two trees, and for the product of any tree with any cycle. If the length of a cycle C is a multiple of 4 then our results give the exact value of the strong chromatic index of the product of C with an arbitrary tree.

Definitions and notation
Following the standard notation, C ℓ denotes the cycle graph of length ℓ. We write u ∼ v to say u is adjacent to v.
For any edge (u, v) in a graph G, define the edge degree d ′ (u, v) of (u, v) to be the number of edges incident either to u or to v. That is, The maximum edge degree of a graph, denoted by ∆ ′ (G), is the maximum of all the edge degrees.
Recall that the Cartesian product of any two graphs G and H, denoted by G H, is the graph with vertex set {a : u | a ∈ V (G) and u ∈ V (H)}, where two vertices a : u and b : v are adjacent if either a = b and u is adjacent to v in H, or u = v and a is adjacent to b in G.
For any vertex h of H define a G-fiber G × {h} to be the graph with vertex set Another type of graph product is the categorical product or direct product of G and H, denoted by G × H. It also has the vertex set {a : u | a ∈ V (G) and u ∈ V (H)}, but in this product vertices a : u and b : v are adjacent if a ∼ b in G and u ∼ v in H. Notation is expressive for both kinds of products, indicating that K 2 K 2 ∼ = C 4 and K 2 × K 2 ∼ = 2K 2 .

Strong edge coloring of unitary Cayley graphs
In this section we determine the strong chromatic index of all unitary Cayley graphs.
From its definition, it follows that the Cayley graph X n is a φ(n)-regular graph of order n. Therefore, the size (number of edges) of X n is n φ(n) 2 . Note that if n has prime divisors p 1 , . . . , p k then φ(n) = n k i=1 1 − 1 p i . It will also be convenient to introduce the notation n ′ = n k i=1 p i , and to write n ′′ = k i=1 p i . Our main result is the following formula.
Theorem 2.1 Let n be a natural number with the prime factorization p r 1 1 p r 2 2 . . . p r k k . Then Proof We prove that |E| 2 k−1 is both an upper bound and a lower bound on χ ′ s (X n ). First let us make some observations on the structure of X n . Each v ∈ Z n can be classified according to its residues modulo the prime factors, assigning with v the k-tuple This assignment partitions the vertex set into n ′′ = p 1 p 2 ...p k classes, each class having cardinality n ′ = p r 1 −1 . These are precisely the classes of false twins: if u = v , then u and v are not adjacent but they have exactly the same neighborhood.
As it can be seen directly from the definition, non-adjacency means that the two numbers in question are incongruent modulo each p i . In this way we can represent X n with a k-dimensional box, first taking the categorical product graph K * := K p 1 × K p 2 × · · · × K p k , and then substituting independent sets of size n ′ (sets of false twins) into the product graph; that is, each edge of K * is enlarged to an induced copy of the complete bipartite graph K n ′ ,n ′ . (This graph only rarely happens to be a product graph after substitution.) Let us note further that if n = p r , i.e. in case n has just one prime divisor, X n is the complete p-partite graph in which each vertex class has p r−1 vertices. Then no two edges of X n can form an induced matching, and the unique strong edge coloring assigns a distinct color to each edge. For this reason, clearly holds, and we only have to consider k ≥ 2.
We first prove the upper bound given in the theorem.

Proof of the upper bound:
We show that the edge set of X n can be partitioned into induced matchings of size 2 k−1 . This clearly implies the inequality χ ′ s ≤ |E| 2 k−1 . To this end, we construct an edge partition for K * , where the graph K * is actually just X n ′′ . Consider any edge (u, v) ∈ K p 1 × · · · × K p k . Let us write u and v in the form u = (a 1 , . . . , a k ) and as otherwise the corresponding two numbers would share a prime divisor. Hence every v ∈ S has one and only one neighbor in S; that is, S induces a matching, which then necessarily has |S|/2 = 2 k−1 edges. Note further that every edge induced by S determines exactly the same set S, and so each edge of K * belongs to precisely one induced matching defined in this way.
Substituting independent sets of size n ′ into the vertices of K * , each edge gets replaced by a subgraph isomorphic to K n ′ ,n ′ . One such example is shown in Figure 1. Therefore each induced matching of size 2 k−1 from K * becomes an induced subgraph isomorphic to 2 k−1 K n ′ ,n ′ in X n . Since the induced matchings defined in K * are mutually edge-disjoint, these copies of 2 k−1 K n ′ ,n ′ are edge-disjoint. Obviously each of these subgraphs can be decomposed into (n ′ ) 2 edge-disjoint induced matchings of size 2 k−1 . Consequently we obtain a required edge partition of X n , and the upper bound χ ′ s ≤ |E| 2 k−1 follows.
In the proof of the lower bound we shall apply a particular case of the following theorem due to Alon [2]. Originally the result was stated for pairs of k-tuples of sets, we rewrite it with a somewhat simpler formalism dealing with pairs of sets.
Moreover let s 1 , . . . , s k and t 1 , . . . , t k be positive integers. Assume that (A 1 , B 1 ), . . . , (A m , B m ) are pairs of sets with the following properties: Note that in case of Proof of the lower bound: We prove that the largest induced matchings in X n have no more than 2 k−1 edges. This clearly imply the lower bound χ ′ s ≥ |E| 2 k−1 . Assume that the edges (u 1 , v 1 ), . . . , (u h , v h ) form an induced matching. We further define 2h pairs of sets (A i , B i ) over an underlying set Y = Y 1 ∪ · · · ∪ Y k ; two pairs of sets are to be defined for each edge. For every 1 ≤ ℓ ≤ k we write Y ℓ = {y ℓ 0 , y ℓ 1 , . . . , y ℓ p ℓ −1 }; those vertices represent the residue classes modulo p ℓ .
The ordered k-tuple v of integers allows us to associate a k-element subset H(v) ⊂ Y with each vertex v ∈ X n as follows: Then the sets of the same index are disjoint, due to the adjacency of u i and v i . On the other hand, since u i is not adjacent to It follows that the pairs (A 1 , B 1 ), . . . , (A 2h , B 2h ) satisfy the conditions of Lemma 2.2, with s ℓ = t ℓ = 1 for all 1 ≤ ℓ ≤ k. Consequently 2h ≤ 2 k holds, so that every induced matching has at most 2 k−1 edges, as claimed. This completes the proof of the theorem.

Cartesian product of two trees
In this section, we give both a lower and an upper bound for the strong chromatic index of the Cartesian product of two trees. First we prove that twice the maximum degree is an upper bound for the strong chromatic index of the product of two trees. Recall the Brualdi and Quinn Massey's conjecture bound for the strong chromatic index of the bipartite graphs (the strong chromatic index of a (A, B)-partite graph is at most ∆(A)∆(B)) [8]. Note that the product of two trees is a bipartite graph. So our result implies the product of two trees satisfies the conjectured bound given by Brualdi and Quinn Massey.
Proof Let x and y be leaves of T 1 and T 2 respectively. We consider T 1 and T 2 as rooted trees with roots x and y respectively. Each of x and y has unique neighbors in their respective trees. Let a be the only neighbor of x in T 1 and c be that of y in T 2 .
The idea is to construct a tower of induced subgraphs G 1 = S 1 S 2 ⊆ G 2 ⊆ G 3 ⊆ ... ⊆ G n = T 1 T 2 of T 1 T 2 and in each step we extend the coloring of G i−1 to a strong edge coloring of G i , so that the coloring satisfies the following conditions: (i) All the edges of T 1 × V (T 2 ) (recall it is collection of all the edges of the T 1 -fibers) use colors from {1, 2, 3, ..., 2∆ 1 }.
(iii) The distance from v to v ′ is even in T 2 if and only if for every (u, u ′ ) ∈ E(T 1 ), the color of the edge (u : v, u ′ : v) is same as the color of (u : v ′ , u ′ : v ′ ).
(iv) The distance from u to u ′ is even in T 1 if and only if for every (v, v ′ ) ∈ E(T 2 ), the color of the edge (u : v, u : v ′ ) is same as the color of (u ′ : v, u ′ : v ′ ).
Loosely speaking this will be carried out by visiting carefully selected representative vertices in a sequence where the incident uncolored edges are in an interaction with relatively few previously colored edges; and then copy the colors to further subsets of edges in the current subgraph. The procedure will be performed on T 1 and T 2 separately. This approach can be formalised in a precise way as described below.
Since T 1 is a tree, if a ′ and a ′′ are adjacent to a, then they are not adjacent to each other, therefore {(a ′ : y, a ′ : c) | a ′ ∼ a} forms an induced matching; and so does x : y Suppose we have a coloring of G ℓ−1 that satisfies (i), (ii), (iii), (iv). Now we give coloring to the rest of the edges of G ℓ . First we assign the colors to Let u be a vertex of T 1 of distance ℓ − 1 from x and s be its parent. The colored edges of distance two from {(u : y, u ′ : y) | u ′ = s, u ′ ∼ u} are the edges incident to s : y or u : c. Since G ℓ−1 satisfies (i) and (ii), so (s : c, u : c) is the only edge adjacent to u : c that uses a color among 1, 2, 3, ..., 2∆ 1 . Again, coloring of G i−1 satisfies (iii), there are at least ∆ 1 − 1 colors among {1, 2, 3, ..., 2∆ 1 }, not being used by any of the edges incident to s : y or by the edge (s : c, u : c). We can assign those colors to {(u : y, u ′ : y) | u ′ = s, u ′ ∼ u}, so that no two edges get the same color. Then for any fixed u ′ = s where u ′ ∼ u, the only colored edges of distance two from (u : c, u ′ : c) are the edges incident to s : c or incident to one of the vertices of the set {u : c ′ | c ′ ∼ c}. Now for any c ′ = y adjacent to c, (s : c ′ , u : c ′ ) is the only edge incident to u : c ′ that uses colors among 1, 2, 3, ..., 2∆ 1 (by (i), (ii)). Again (iii) says that the color of (s : c ′ , u : c ′ ) is the color of (s : y, u : y). Therefore, there are ∆ 1 − 1 suitable colors among 1, 2, 3, ..., 2∆ 1 for {(u : c, u ′ : c) | u ′ = s, u ′ ∼ u}.
Distribute those colors to {(u : c, u ′ : c) | u ′ = s, u ′ ∼ u}. Now we claim the following for a fixed u ′ = s, where u ′ is adjacent to u.
Claim: We can assign the color of (u : v, Proof of the Claim: We apply induction on distance from u. If (u : t, u ′ : t) is already colored, then the induction hypothesis assures the claim. Now we may assume that (u : t, u ′ : t) did not get a color till now and v ′ is adjacent to both v and t. The only colored edges of distance two from (u : t, u ′ : t) are {(s : t ′ , u : t ′ ) | t ′ is a child of t} and the edges incident to u : v ′ or s : t. Since the coloring of G ℓ−1 satisfies (iii), the only colors which may create problems are the colors of the edges incident to u : v ′ or s : t.
Since v ′ is adjacent to t, the color of (u : v, u ′ : v) is not used by any of the edges incident to u : v ′ . Also (iii) ensures that it is not used by the edges incident to s : t. Again {(u : t, u ′ : t) | d T 2 (v, t) = 2} is an induced matching. Hence we can assign the color of (u : v, u ′ : v) to {(u : t, u ′ : t) | d T 2 (v, t) = 2}. The claim is proved. By coloring accordingly we get a partial strong edge coloring that satisfies (i) and (iii).
In the above theorem we observed an upper bound for the Cartesian product of two trees. This bound is tight. That is there exist trees T 1 and T 2 such that χ ′ s (T 1 T 2 ) = 2∆(T 1 T 2 ). Before showing that, we find a lower bound for the same, in the next theorem.
Let T 1 and T 2 be two trees and suppose that one of them has two maximum-degree vertices adjacent to each other. Then the upper and lower bound of χ ′ s (T 1 T 2 ) are the same. So the following corollary is immediate. Corollary 3.3 Let T be a tree. Then χ ′ s (T P n ) = 2(∆(T ) + ∆(P n )) = 2∆(T P n ) for every n > 3, or n = 2.
In general the upper bound does not hold with equality. An example is the Cartesian product of two stars. Its strong chromatic index is determined in the following theorem.  , {y 1 , ..., y m }) be the bipartition of K 1,n and K 1,m respectively. We first give a strong edge coloring on K 1,n K 1,m with 2n + m + 2 colors as follows.
• n + m colors on the edges incident with the vertex x : y, one dedicated color for each edge.
• n−m colors on the 'long' edges of the K 1,n -fibers, namely one color for each induced matching of type {(x : y j , x i : y j ) | 1 ≤ j ≤ m}, in the range m + 1 ≤ i ≤ n.
• m colors on induced matchings which take one edge from each of n − 1 K 1,m -fibers and one from each of m − 1 K 1,n -fibers, defined as Hence the vertices of type x i : y j in A i are located in the union of two fibers, namely in ({x i } × K 1,m ) ∪ (K 1,n × {y i }), omitting their intersection vertex x i : y i .
• 2 colors for the edges ending in the diagonal vertices x i : y i , namely one color for It is easily checked that each color class is an induced matching, and their union covers the entire edge set. Next we show that fewer than 2n + m + 2 colors are not enough. Note that each of the n + m edges incident with the vertex x : y is adjacent to every other edge. This requires n + m private colors for these edges. Hence it is sufficient to prove that the edges not incident with x : y require more than n + 1 further colors. Since no color can occur more than once on the edges of any K 1,m -fiber centered at an x i : y, neither on any K 1,n -fiber centered at an x : y i , only the following three types of color classes can occur: (i) Precisely m edges (x : y i , x j i : y i ) for i = 1, 2, . . . , m, where j i is arbitrary (1 ≤ j i ≤ n); let the number of such color classes be denoted by a.
(ii) At most m − 1 edges incident with vertices of type x : y i , and at most n − 1 edges incident with some of the x i : y ; let the number of such color classes be denoted by b.
(iii) Precisely n edges (x i : y, x i : y j i ) for i = 1, 2, . . . , n, where j i is arbitrary (1 ≤ j i ≤ m); let the number of such color classes be denoted by c.
Hence the number of edges involved in such a color partition is distributed as shown in Table 1. (The row correspondng to b gives an upper bound, the other lines are exact.) # of classes K 1,m -edges K 1,n -edges Table 1: Number of classes, and largest possible number of edges per class.
The n copies of K 1,m , as well as the m copies of K 1,n , contain precisely mn edges. Therefore the following inequalities must hold: Rearrangement yields Thus, This inequality implies the required lower bound a + b + c > n + 1, unless In this case, however, we have from which, using (3), we obtain a + b ≥ n + b/m > n + 1.

Cartesian product of a tree and a cycle
In this section we give lower and upper bounds for the strong chromatic index of the Cartesian product of a tree and a cycle. Also we determine the exact value of that, if the length of the cycle is 4ℓ for some ℓ ≥ 1. Throughout this section T means any tree, and ∆ stands for its maximum degree, as a shorthand for ∆(T ). Proof Corollary 3.3 says that the strong chromatic index of the Cartesian product of T and a path longer than one is 2∆ + 4. Now C contains a path with 3 vertices. Therefore This inequality holds with equality if the length of the cycle is divisible by 4. We prove this in the next theorem.

Theorem 4.2
The strong chromatic index of T C 4ℓ is 2∆ + 4.
Proof The above lemma says that χ ′ s (T C 4ℓ ) ≥ 2∆ + 4. Now we show that there is a strong edge coloring on T C 4ℓ that uses 2∆ + 4 colors.
We can extend this coloring to T C 4ℓ by defining c((u : t 4ℓ , u : t 1 )) := 2∆ + 2, if d T (u, a) is odd 2∆ + 4, otherwise We claim that this is a strong edge coloring. Since the coloring c satisfies (i), (ii), (iii) and (iv), it is enough to show the following three properties for every vertex u of T and any two vertices v and v ′ adjacent to it.
The above theorem determines the strong chromatic index of the Cartesian product of a tree and a cycle whose length is a multiple of 4. Next we find an upper bound for the Cartesian product of a tree with a cycle of any even length. We state this for the 6-cycle first, and then in Theorem 4.5 we find a better bound for the remaining even cycles. be two edges of A i . By the definition of the Cartesian product, u : t i is not adjacent to v : t i+1 and u : t i+1 is not adjacent to v : t i . Again both d T (u, a) and d T (v, a) are even. So u : t i (respectively u : t i+1 ) is not adjacent to v : t i (respectively v : t i+1 ). Therefore A i is an induced matching, for every i. Similarly we can show that for every i, B i is an induced matching. Moreover it satisfies the following properties.
1. For |i − j| > 2 mod (2ℓ) the sets A i ∪ A j and B i ∪ B j are induced matchings.
Proof: Let (u : t i , u : t i+1 ) ∈ A i and (v : t j , v : t j+1 ) ∈ A j . Since |i − j| > 2 mod (2ℓ), the definition of the strong edge coloring says that {(u : t i , u : t i+1 ), (v : t j , v : t j+1 )} is an induced matching. Again both A i and A j are induced matchings. Hence so is A i ∪ A j . Similarly we can show that B i ∪ B j is an induced matching.
2. Let t i be not adjacent to t j . Then A i ∪ B j and A j ∪ B i are induced matchings.
The proof is similar to that of 1.
We have assumed that i > 3 and 2ℓ ≡ 2 mod 4. Therefore the above mentioned properties say that the following five sets are induced matchings: This bound is also tight. The strong chromatic index of C 10 P 2 is 7. The above theorem and Theorem 4.1 say that the strong chromatic index of the Cartesian product of a tree T and an even cycle C 2ℓ of length more than 6 is either 2∆(T ) + 4 or 2∆(T ) + 5. In the next two theorems we prove an upper bound for the strong chromatic index of any tree with cycles of odd length. First we consider cycles of length more than 8.
Proof Let a be a vertex of maximum degree in T , and set C 2ℓ+1 = t 1 t 2 ...t 2ℓ+1 t 1 . We view a as the root of T . Let D 1 , D 2 , ..., D χ ′ s (T ) be a partition (some of the D i may be empty) of the edges of T into induced matchings. We are going to define a strong edge coloring c on T C 2ℓ+1 . First we give colors to the edges of all the T -fibers.
The remaining (uncolored) edges are the edges of all the C-fibers. Therefore it is sufficient to partition them into five induced matchings. As in the proof of the earlier theorem, we partition them into the sets It is easy to see that the following properties hold.
(i) For every i, A i and B i are induced matchings.
(ii) Let |i − j| > 2 mod (2ℓ + 1). Then A i ∪ A j and B i ∪ B j are induced matchings.
(iii) Let t i is not adjacent to j. Then A i ∪ B j and A j ∪ B i are induced matchings. Now B 1 ∪ A 5 ∪ B 7 is an induced matching because 2ℓ + 1 ≡ 1 or 3 mod 4. Therefore it is enough to partition the rest of the edges into four induced matchings. If 2ℓ + 1 ≡ 1 mod 4, then the sets partition V (T ) × C 2ℓ+1 into induced matchings. Otherwise 2ℓ + 1 ≡ 3 mod 4, and then the sets form a required partition.
Above we obtained bounds for the strong chromatic index of a tree with a cycle of length different from 3, 5 and 7. Now we find a slightly larger upper bound for the same when a cycle is of length 3, 5 and 7.
Proof Let a be an arbitrary vertex of T . We can assign the colors 1, 2, 3, ..., 2∆ + ⌈ ∆ ℓ ⌉ to the edges of T × V (C 2ℓ+1 ) in the same way as in the proof of the previous theorem. The only edges which remain to be colored are the edges of V (T ) × C 2ℓ+1 .
Define A i and B i as in the preceding proof, for i ≤ 2ℓ + 1. We have already shown above that the sets A i and B i are induced matchings. Hence χ ′ s (T C 3 ) ≤ 3∆ + 6. Now further properties of these A i and B i (as mentioned above) ensure that the following properties are true.
Finally, we give a better lower bound for the same when the cycle is of odd length. For that, first we define jellyfish graphs. Let H be a graph obtained from C k by adding p v new pendant vertices adjacent to v, for each vertex v in C k . Then H is called a C kjellyfish. On such graphs, Chang et al. [11] proved a general lower bound (their Theorem 13), which implies the following formula.
Theorem 4.8 [11] If G is a C k -jellyfish of m edges, such that k is odd and all vertices of C k have the same degree in G, then χ ′ s (G) ≥ ⌈ m ⌊k/2⌋ ⌉.
Remark Note that the difference of the lower and the upper bound for the strong chromatic index of a tree with an odd cycle is at most 4. In fact, if the odd cycle is of length at least 9, then the difference is at most 3.

Conclusion
Theorem 4.7 and Corollary 4.9 gives the upper and lower bound for the strong chromatic index of any tree with product with C 3 . The strong chromatic index of K 2 C 3 and P 3 C 3 are 9 and 9 respectively. Therefore we can not improve the bounds for the strong chromatic index of product of a tree with C 3 . For other odd cycles this bounds might be improved. We have already discussed the tightness of bounds for the strong chromatic index of product of trees with even cycles.