Abstract
Let G = (V, E) be a graph with chromatic number <TEX>${\chi}(G)$</TEX>. dominating set D of G is called a chromatic transversal dominating set (ctd-set) if D intersects every color class of every <TEX>${\chi}$</TEX>-partition of G. The minimum cardinality of a ctd-set of G is called the chromatic transversal domination number of G and is denoted by <TEX>${\gamma}_{ct}$</TEX>(G). In this paper we characterize the class of trees, unicyclic graphs and cubic graphs for which the chromatic transversal domination number is equal to the connected domination number.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
