A proper coloring of a graph G = (V,E) is a mapping f: V → {1,2,3,...}such that if e = vivj € E, then f vi ≠ f(vj ). A proper coloring of a directed graph (digraph) G is said to admit star-in-coloring, if the graph has to satisfy the following two conditions: (i) no path of length threeis bicolored (ii) if any path of length twowith terminal vertices are of the same color, then the edges must be oriented towards the middle vertex. The minimum number of colors required to color a graph G as star-in-coloring, is called the star-in- chromatic number of the graph G and it is denoted by Χsi(G).In this paper, we consider the splitting graphs of the graphs such as cycle, gear, regular cyclic, a complete binary tree and web graph, we investigatethe star- in-chromatic number of these graphs