Please use this identifier to cite or link to this item: http://10.9.150.37:8080/dspace//handle/atmiyauni/804
Full metadata record
DC FieldValueLanguage
dc.contributor.authorThakkar, D.K.-
dc.contributor.authorJamvecha, Neha P.-
dc.date.accessioned2023-05-01T02:41:50Z-
dc.date.available2023-05-01T02:41:50Z-
dc.date.issued2017-09-06-
dc.identifier.citationThakkar, D. K., & Jamvecha, N. P. (2017). About ve-domination in graphs. Annals of Pure and Applied Mathematics, 14(2), 245-250.en_US
dc.identifier.issn2279-0888-
dc.identifier.urihttp://10.9.150.37:8080/dspace//handle/atmiyauni/804-
dc.descriptionAcknowledgement: The authors are thankful to the reviewer for their comments and suggestions for improving the quality of this paper.en_US
dc.description.abstractThe paper is about the ve-domination (vertex-edge domination) in graphs. Necessary and sufficient conditions are proved under which the ve-domination number decreases or increases.en_US
dc.language.isoenen_US
dc.publisherAnnals of Pure and Applied Mathematicsen_US
dc.subjectve-dominating seten_US
dc.subjectminimal ve-dominating seten_US
dc.subjectminimum ve-dominating seten_US
dc.subjectve-domination numberen_US
dc.subjectedge private neighbourhooden_US
dc.titleAbout -ve domination in graphsen_US
dc.typeArticleen_US
Appears in Collections:01. Journal Articles

Files in This Item:
File Description SizeFormat 
409) 67814_Nehaben Pankajbhai Jamvecha.pdf81.57 kBAdobe PDFView/Open
Show simple item record


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