A Note on Chromatic Transversal Weak Domination in Graphs
S Balamurugan, P Selvalakshmi, A. Arivalagan · International Journal of Mathematics Trends and Technology · 2015
Let , G V E be a graph wi th chromatic n u m b e r 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 charectarize ctwd G n .