A note on δ^(k)-colouring of the Cartesian product of some graphs

Abstract

The chromatic number, Χ(G) of a graph G is the minimum number of colours used in a proper colouring of G. In improper colouring, an edge uv is bad if the colours assigned to the end vertices of the edge is the same. Now, if the available colours are less than that of the chromatic number of graph G, then colouring the graph with the available colours leads to bad edges in G. The number of bad edges resulting from a δ(k)-colouring of G is denoted by bk(G). In this paper, we use the concept of δ(k)-colouring and determine the number of bad edges in the Cartesian product of some graphs.