The week's pick
Random Articles
Reseach Article
Colourings in Bipartite Graphs
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 25 - Number 3 |
| Year of Publication: 2011 |
| Authors: Y.B.Venkatakrishnan, V.Swaminathan |
10.5120/3015-4075
|
Y.B.Venkatakrishnan, V.Swaminathan . Colourings in Bipartite Graphs. International Journal of Computer Applications. 25, 3 ( July 2011), 1-6. DOI=10.5120/3015-4075
Abstract
The concept of X-chromatic partition and hyper independent chromatic partition of bipartite graphs were introduced by Stephen Hedetniemi and Renu Laskar. We find the bounds for X-chromatic number and hyper independent chromatic number of a bipartite graph. The existence of bipartite graph with χh(G)=a and γY(G)=b-1, χh(G)=a and χX(G)=b where a ≤b are proved. We also prove the existence of bipartite graphs for any three positive integers a, b, c such that c ≥ 2(b-a)+1, there exists a graph G such that χX(G)=a, χXd(G)=b and |Y|=c. The bipartite theory of Dominator colouring is introduced.
References
- Gera.R, Horton.S and Ramussen.C, Dominator coloring and safe clique partition, Congressus Numerantium, Volume 181 (2006), 19-32.
- Haynes T.W, Hedetneimi S.T, Slater P.J, Fundamentals of domination in graphs, Marcel Dekker., Inc., 1988.
- Haynes T.W, Hedetneimi S.T, Slater P.J, Domination in graphs Advanced topics, Marcel Dekker., Inc., 1988.
- Stephen Hedetneimi, Renu Laskar, A Bipartite theory of graphs I, Congressus Numerantium, Volume 55, December 1986, 5-14.
- Stephen Hedetneimi, Renu Laskar, A Bipartite theory of graphs II, Congressus Numerantium, Volume 64, November 1988, 137-146.
- Swaminathan.V, Venkatakrishnan Y.B, Some Characterization theorems, Mathematical and computational Models, edited by R.Nadarajan et al., Narosa Publishing House, India (2008) 201-206.
Index Terms
Keywords