On bDS - Coloring of corona graph of certain graphs

Abstract

Let G = (V(G),E(G)) be a simple graph and a bDS-coloring [6,9,1l]of a graph is a coloring of the vertices where each color class contains a vertex that has a neighbor in all other color classes and for every v ∈ V(G) of degree at least two ,the neighbors of v receive at least two distinct colors also if every path of G on four vertices is not 2-colored. In this paper, we find out the bDS- chromatic number for corona graph of path with triangular, double triangular and diamond graph on the same order n.