Equitable Colouring of Lexicographic Product of Semi-Total Point Graph with Certain Graphs

Abstract

Equitable colouring of a graph  is a proper colouring of graph if the number of vertices with any two-colour classes vary by at most one and the equitable chromatic number is the minimum number of colour classes and is symbolized by . This paper attempts to establish the acceptance of equitable colouring to the lexicographic product of two graphs  and , denoted by . First,  can be considered as the path and  as the path, cycle, complete and bipartite graph. Secondly,  as the cycle and  as the path, cycle, complete and bipartite graph.