ON b-COLORING OF CENTRAL GRAPH OF SOME GRAPHS

The b-chromatic number of G, denoted by phi(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 xi having neighbors in all the other k-1 color classes. Such a vertex xi is called a b-dominating vertex, and the set of vertices {x(1), x(2) ... x(k)} is called a b-chromatic system. In this paper, we are going to investigate on the b number of Central graph of Triangular Snake graph, Sunlet graph, Helm Graph, Double Triangular Snake graph, Gear graph, and Closed Helm graph are denoted as C(T-n), C(S-n), C(H-n), C(DTn), C(G(n)), C(CHn) respectively.