• Stephen John B
• Ashlin Suji M.D

Let G={V,E} be a connected simple graph. The transformation graph G - + - of this G is the graph with the union of vertex set and edge set in which the adjacency of two vertices a and b is defined as follows: (i) a and b in V(G) are adjacent if and only if they are non- adjacent in G (ii) a and b in E(G) are adjacent if and only if they are adjacent in G (iii)a and b in V(G) while the other is in E(G) , they are not incident in G . In this paper we established the color class and chromatic number to the transformation Cycle, Path , Star graphs.

Path graph, Cycle graph, Star graph, Transformation, Vertex Coloring, Chromatic number.

"A chromatic number to the transformation Graph(G - + - ) ", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 4, page no.374-378, April-2019, Available :http://www.jetir.org/papers/JETIR1904669.pdf

"A chromatic number to the transformation Graph(G - + - ) ", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 4, page no. pp374-378, April-2019, Available at : http://www.jetir.org/papers/JETIR1904669.pdf