An injective k-edge coloring of a graph G is a k-edge coloring φ of G such that φ(e1)≠φ(e3) for any three consecutive edges e1,e2 and e3 of a path or a 3-cycle. The injective edge chromatic index of G, denoted by χi′(G), is the minimum k such that G has an injective k-edge coloring. Li and Chen determined the injective edge chromatic index of the generalized Petersen graph P(n,k) for 1 ≤ k ≤ 2. In this paper, we consider the injective edge coloring of the generalized Petersen graph P(ck,k) and show that χi′(P(ck,k)) ≤ 5 for...
