Given a coloring of graph G and any subgraph we define . In particular, we denote by . The coloring is called an IC-coloring if for any integer there is a connected subgraph such that . Also, we define the IC-index of G to beIn this paper we examine some well-known classes of graphs and determine their IC-indices. In addition, several conjectures are proposed.