Title of article :
Chromatic transversal Roman domination in graphs
Author/Authors :
Pushpam ، P. Roushini Leely Department of Mathematics - D.B. Jain College
From page :
51
To page :
66
Abstract :
For a graph G with chromatic number k, a dominating set S of G is called a chromatic-transversal dominating set (ctd-set) if S intersects every color class of any k-coloring of G.
Keywords :
domination , Coloring , Chromatic Transversal Roman domination
Journal title :
Communications in Combinatorics and Optimization
Journal title :
Communications in Combinatorics and Optimization
Record number :
2777632
Link To Document :
بازگشت