• CHROMATIC NUMBER TO THE TRANSFORMATION (G^(---)) OF P_n AND C_n

B. STEPHEN JOHN, S. ANDRIN SHAHILA*

Abstract


Let  be an undirected simple graph. The transformation graph  of G is a simple graph with vertex set  in which adjacency is defined as follows: (a) two elements in  are adjacent if and only if they are non-adjacent in  (b) two elements in  are adjacent if and only if they are non-adjacent in  and (c) an element of   and an element of   are adjacent if and only if they are non-incident in . In this paper, we determine the chromatic number of Transformation graph  for Path and Cycle graph.


Keywords


Path, Cycle, Chromatic Number, Transformation Graph.

Full Text:

PDF


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 Unported License.
© 2010-2018 International Journal of Mathematical Archive (IJMA)
Copyright Agreement & Authorship Responsibility
Web Counter