Please use this identifier to cite or link to this item: http://10.9.150.37:8080/dspace//handle/atmiyauni/806
Full metadata record
DC FieldValueLanguage
dc.contributor.authorVaidya, S.K.-
dc.contributor.authorParmar, A.D.-
dc.date.accessioned2023-05-01T03:00:33Z-
dc.date.available2023-05-01T03:00:33Z-
dc.date.issued2019-06-
dc.identifier.citationVaidya, 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-9424en_US
dc.identifier.issn0973-9424-
dc.identifier.urihttp://10.9.150.37:8080/dspace//handle/atmiyauni/806-
dc.descriptionAcknowledgement: 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.abstractA 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.isoenen_US
dc.publisherInternational Journal of Mathematical Sciences and Engineering Applicationsen_US
dc.subjectcoloringen_US
dc.subjectdominationen_US
dc.subjectChromatic transversal dominating seten_US
dc.titleSome new results on chromatic transversal domination in graphsen_US
dc.typeArticleen_US
Appears in Collections:01. Journal Articles

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


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