Some new results on chromatic transversal domination in graphs

Vaidya, S.K.; Parmar, A.D.

dc.contributor.author	Vaidya, S.K.
dc.contributor.author	Parmar, A.D.
dc.date.accessioned	2023-05-01T03:00:33Z
dc.date.available	2023-05-01T03:00:33Z
dc.date.issued	2019-06
dc.identifier.citation	Vaidya, S.K. & Parmar,A.D.(2019).Some new results on chromatic transversal domination in graphs.International Journal of Mathematical Sciences and Engineering Applications,Volume-13(1),15-23 ISSN: 0973-9424	en_US
dc.identifier.issn	0973-9424
dc.identifier.uri	http://10.9.150.37:8080/dspace//handle/atmiyauni/806
dc.description	Acknowledgement: The authors are highly thankful to the anonymous referee for kind comments and constructive suggestions on the first draft of this paper.	en_US
dc.description.abstract	A vertex dominating set D of V (G) is called a chromatic transversal dominating set of G if D intersects every color class of G. The minimum cardinality of D is called a chromatic transversal domination number of G. In this work we contribute some new results on chromatic transversal domination.	en_US
dc.language.iso	en	en_US
dc.publisher	International Journal of Mathematical Sciences and Engineering Applications	en_US
dc.subject	coloring	en_US
dc.subject	domination	en_US
dc.subject	Chromatic transversal dominating set	en_US
dc.title	Some new results on chromatic transversal domination in graphs	en_US
dc.type	Article	en_US