Please use this identifier to cite or link to this item: http://10.9.150.37:8080/dspace//handle/atmiyauni/806
Title: Some new results on chromatic transversal domination in graphs
Authors: Vaidya, S.K.
Parmar, A.D.
Keywords: coloring
domination
Chromatic transversal dominating set
Issue Date: Jun-2019
Publisher: International Journal of Mathematical Sciences and Engineering Applications
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
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.
Description: Acknowledgement: The authors are highly thankful to the anonymous referee for kind comments and constructive suggestions on the first draft of this paper.
URI: http://10.9.150.37:8080/dspace//handle/atmiyauni/806
ISSN: 0973-9424
Appears in Collections:01. Journal Articles

Files in This Item:
File Description SizeFormat 
405) 57750_Anil Dhanjibhai Parmar.pdf190.59 kBAdobe PDFView/Open
Show full item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.