Perfect colouring of the graph with its kinds
Archana Bhange, Haribhau R. Bhapkar · Journal of Physics Conference Series · 2020
Abstract The Perfect colouring (jp) of a graph is an assignment of colours to all elements (vertices, edges, and regions) of the graph such that no two adjoint elements receive the same colour. In this paper, we determined the tight bounds of perfect colouring as/“(G) </P(G) </“(G) + 4, where/“(G) is total colouring of the graph G. Depending on these bounds, the perfect colouring is divided into five different kinds, and the results of these for some standard graphs are presented in the paper.