For a positive integer πβ₯2, the radio k-coloring problem is an assignment L of non-negative integers (colors) to the vertices of a finite simple graph G satisfying the condition |πΏ(π’)βπΏ(π£)|β₯π+1βπ(π’,π£), for any two distinct vertices u, v of G and d(u, v) being distance between u, v. The span of L is the largest integer assigned by L, while 0 is taken as the smallest color. An πππ-coloring on G is a radio k-coloring on G of minimum span which is referred as the radio k-chromatic number of G and denoted by πππ(πΊ). An integer h, 0<β<πππ(πΊ), is a hole in a πππ-coloring on G if h is not assigned by it. In this paper, we construct a larger graph from a graph of a certain class by using a combinatorial property associated with (πβ1) consecutive holes in any πππ-coloring of a graph. Exploiting the same property, we introduce a new graph parameter, referred as (πβ1)-hole index of G and denoted by ππ(πΊ). We also explore several properties of ππ(πΊ) including its upper bound and relation with the path covering number of the complement πΊπ.