No abstract

A dominator coloring is a coloring of the vertices of a graph such that every vertex is either alone in its color class or adjacent to all vertices of at least one other color class. In this paper, we obtain the dominator chromatic number for the Line graph of some graphs, Central graph of Line graph of Star graph and Central graph of Line graph of Double Star graph. And also we obtain the dominator chromatic number for J(Sn); J(Cn) and J(K 1;n;n;n ) respectively.

It is largely applied in Wireless Sensor Networks (WSN). It acts as a virtual backbone in WSNs.algorithms of finding such minimum connected dominating set was studied. A new algorithm for constructing a routing in WSN using one of the algorithms is proposed and implemented using java language. The sampleoutputs are also included

The b chromatic number of G, denoted by '(G), is the maximum k for which G has a b coloring by k colors. A b coloring of G by k colors is a proper k-coloring of the vertices of G such that in each color class i there exists a vertex x i having neighbors in all the other k 1 color classes. Such a vertex x i is called a b dominating vertex, and the set of vertices fx 1 ; x 2 : : : x k g is called a b dominating system. In this paper, we are going to investigate on the b chromatic

No abstract