Injective coloring of edge corona product of graphs

Abstract The injective chromatic number χ i (G) of a graph G is the minimum number of colors needed to color the vertices of G such that different vertices with the same neighbor are colored differently. In this here, we get some exact values of the injective chromatic number of the edge corona product of some graphs.