CHROMATIC NUMBER TO THE TRANSFORMATION (G---) OF K(1,n) AND K(m,n)
Main Article Content
Abstract
Let  be an undirected simple graph. The transformation graph  ofG 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 Star and Complete Bipartite graph.
Â
Keywords: Star Graph, Complete Bipartite Graph, Chromatic Number, Transformation Graph
Downloads
Article Details
References
H. Abdollahzadeh Ahangar, L. Pushpalatha, "On the chromatic number of some Harary graphs", International Mathematical Forum, 4,2009, No.31, pp. 1511-1514.
B. Wu, J.Meng, "Basic properties of total transformation graphs", J.math study 34(2) (2001), pp.109-116.
Nikhilesh Sil, A. Datta, S. Samanta, S.Bhattacharya, Priti Kumar Roy, Effect of Migration of Susceptible Prey;Mathematical Sciences International Research Journal ISSN 2278 –8697. Vol 3 Issue 1 (2014), Pg. 447-451
B. Basavanagoud,Keerthi Mirajkarandshripurnamalghan, "Transversability and Planarity of the Transformation graph GxyzProceedings of International conference on graph theory and Applications, Amritha school, 2009, pp. 153-165.
Douglas B. West, "Introduction to graph theory", Second edition, Prentice-Hall of India Private Limited, New Delhi, 2006.