Let G be a connected garph. V=V(G) is a vertexes set of G, f:V→ N is a coloring function and fot any subgraph H G, we define fs(H)= and denote fs(G)=S(f). The function is called an IC-coloring of G if for and k in the set [1,S(f)], there exist an induced connected subgraph H of G, such that fs(H)=k. The IC-index of graph G, denoted byM(G), is defined to be M(G)=max﹛S(f):f is an IC-coloring of G﹜. We say f is a maximal IC-coloring of G if f is an IC-coloring of G with fs(G)=M(G). In this thesis, we find the lower bound and upper bound of the IC-index of K(2,2,n) is 。