IJSR - International Journal of Scientific Research

Dr.A.Vijayalekshmi; J.Virgin Alangara Sheeba

Volume : VIII, Issue : VI, June - 2019

TOTAL DOMINATOR CHROMATIC NUMBER OF PATHS AND CYCLES THROUGH COMPUTER PROGRAMMING

Dr. A. Vijayalekshmi, J. Virgin Alangara Sheeba

Abstract :

A total dominator coloring of a graph G=(V,E) without isolated vertices is a proper coloring together with each vertex in G properly dominates a color class. The total dominator chromatic number of G is a minimum number of color classes with additional condition that each vertex in G properly domi– nates a color class and is denoted by χtd (G). In this paper we introduce C++ programmes that are able to efficiently determine on approximation to the total dominator chromatic number of Paths and Cycles.