International Journal of Mathematics Trends and Technology
Volume 17 | Number 2 | Year 2015 | Article Id. IJMTT-V17P512 | DOI : https://doi.org/10.14445/22315373/IJMTT-V17P512
S. Balamurugan, P. Selvalakshmi, A. Arivalagan, "A Note on Chromatic Transversal Weak Domination in Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 17, no. 2, pp. 89-95, 2015. Crossref, https://doi.org/10.14445/22315373/IJMTT-V17P512
Let G=(V,E) be a graph with chromatic number k. A weak dominating set D of G is called a chromatic transversal weak dominating (ctwd) set if D intersects every colour class of any k-colouring of G. The minimum cardinality of chromatic transversal weak dominating set is called the chromatic transversal Weak domination number of G and it is denoted by γctwd(G). We calculate chromatic transversal weak domination number for some standard graphs and we charecta- rize γctwd(G)=n.
[1] Haynes, T.W., Hedetniemi, S.T., Slater, P.J: Fundamentals of Domination in Graphs, Marcel Decker Inc... New york, 1998.
[2] Sampathkumar.E, and Pushpalatha.L, Strong weak domination and domination balance in a graph, Discrete Math. 161 (1996)235-242.
[3] Harary.F: Graph Theory Addison Wesley, reading Mass (1972).
[4] L.Benedict Michael Raj,S.K. Ayyaswamy and S.Arumugam, Chromatic Transversal Domination in Graphs.
[5] G.Chartrand and L.Lesniak, Graph and Digraph, Chapman and Hall, CRC, 2005.
PDF 
Citation 
Abstract 
Keywords 
References