Abstract

C++ Programme for Total Dominator Chromatic Number of Paths by Using Elementary Transformations

A.Vijayalekshmi1* and J. Virgin Alangara Sheeba2

1Associate Professor of Mathematics, S.T. Hindu College, Nagercoil-629002, Tamil Nadu, INDIA. 2Research scholar, Reg no:11813 Department of Mathematics S.T. Hindu College, Nagercoil-629002, Tamil Nadu, INDIA. Affiliated to Manonmaniam Sundarnar University Tirunelveli – 627 012, Tamil Nadu, India.

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 dominates a color class and is denoted by χtd (G). In this paper, we find the total dominator chromatic number of paths by using elementary transformations through C++ programme. 2010 Mathematics subject classification code: 05C69, 68W25

Keywords :Total dominator coloring, Total dominator chromatic number.

map1 map2 map3