... contradiction and we have the proof of (4).Theorem 3.5. M(Km,n) = 3 · 2m+n−2− 2m−2+ 2 for 2 ≤ m ≤ n.Proof. Let G = Km,n, V (G) = {u1, u2, · · · , um+n} and f be a maximal IC-coloring of G. ... thecolorings of vertices of G are distinct.Proof. Suppose, to the contrary, there exist two distinct vertices u and v such that f(u) =f(v). Now, depending on the distribution of u and v in A ... problem” and he observed the IC-index of cycle Cnis bounded above by n2− n + 1, i.e., M(Cn) ≤n2− n + 1. Later, in 1995, Penrice [12] introduced the concept of stamp covering of G and he...