Volume - 13 | Issue-1
Volume - 13 | Issue-1
Volume - 13 | Issue-1
Volume - 13 | Issue-1
Volume - 13 | Issue-1
Power dominator colouring is a form of vertex colouring for a simple graph G so that each and every vertex in G power dominates a minimum of one colour class. The power dominator chromatic (PDC) number is the least number of colours needed for such colouring in G and will be represented by chi_pd(G). In this article, we determine the power dominator chromatic (PDC) number of line, middle and total graphs of sunlet and helm graphs. Also we obtain the power dominator chromatic (PDC) number of irregular chemical central graph. AMS Subject Classification: 05C15, 05C69