Some results on the b-chromatic number in complementary prism graphs

Abstract

A b-coloring of a graph G is a proper coloring of G with k colors such that each color class has a vertex that is adjacent to at least one vertex of every other color classes. The b-chromatic number is the largest integer k for which G has a b-coloring with k colors. In this paper, we present some results on b-coloring in complementary prism graphs.