ON r-DYNAMIC COLORING OF THE FAMILY OF BISTAR GRAPH

Abstract

An r-dynamic coloring of a graph G is a proper coloring c ofthe 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 hasan r-dynamic coloring with k colors. In this paper, we obtain the r-dynamicchromatic number of middle, total, central and line graph of Bistar graph.