An r-dynamic coloring of a graph G is a proper coloring c of the vertices such that jc(N (v))j min fr; d(v)g, for each v 2 V (G). The rdynamic chromatic number of a graph G is the minimum k such that G has an r-dynamic coloring with k colors. In this paper, we obtain the r-dynamic chromatic number of middle, total, central and line graph of Bistar graph.