Please use this identifier to cite or link to this item: http://10.9.150.37:8080/dspace//handle/atmiyauni/829
Full metadata record
DC FieldValueLanguage
dc.contributor.authorVaidya, S.K.-
dc.contributor.authorAjani, P.D.-
dc.date.accessioned2023-05-01T06:35:01Z-
dc.date.available2023-05-01T06:35:01Z-
dc.date.issued2020-
dc.identifier.citationVaidya, S. K., & Ajani, P. D. (2020). On restrained edge dominating set of graphs. Malaya Journal of Matematik (MJM), 8(1, 2020), 28-31.en_US
dc.identifier.issn2321-5666-
dc.identifier.urihttp://10.9.150.37:8080/dspace//handle/atmiyauni/829-
dc.description.abstractFor a graph G = (V,E), a subset D of E is restrained edge dominating set of G if every edge not in D is adjacent to an edge in D as well as an edge in E −D. The restrained edge domination number of G, denoted by γre(G) is the minimum cardinality of a restrained edge dominating set of G. Here, we characterize restrained edge dominating set and also investigate restrained edge domination number of some wheel related graphs.en_US
dc.language.isoenen_US
dc.publisherMalaya Journal of Matematiken_US
dc.subjectDominating seten_US
dc.subjectRestrained dominating seten_US
dc.subjectRestrained edge dominating numberen_US
dc.subjectRestrained edge dominating seten_US
dc.titleOn restrained edge dominating set of graphsen_US
dc.typeArticleen_US
Appears in Collections:01. Journal Articles

Files in This Item:
File Description SizeFormat 
396) 13079_Parag Devrajbhai Ajani.pdf1.44 MBAdobe PDFView/Open
Show simple item record


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