The b-chromatic number of some special families of graphs

[摘要] Given G, b - coloring is a proper k coloring of G in which each and every color class has at least one b - vertex that has a neighbour in other k - 1 color classes. The largest integer k is the b - chromatic number b(G) for which G having a b - coloring using k colors. In this paper, we constructed some family of graphs and found its b - chromatic number.

[发布机构] Department of Mathematics, School of Advanced Sciences, VIT University, Vellore; 632014, India^1

[效力级别] 工业技术

[关键词] B-chromatic number;K-coloring