Please use this identifier to cite or link to this item: http://10.9.150.37:8080/dspace//handle/atmiyauni/1976
Full metadata record
DC FieldValueLanguage
dc.contributor.authorVaidya, S. K-
dc.contributor.authorAjani, P. D-
dc.date.accessioned2024-11-24T07:03:56Z-
dc.date.available2024-11-24T07:03:56Z-
dc.date.issued2019-
dc.identifier.citationVaidya, S. K., & Ajani, P. D. (2019). On restrained domination number of some wheel related graphs. Malaya Journal of Matematik, 7(01), 104-107.en_US
dc.identifier.urihttp://10.9.150.37:8080/dspace//handle/atmiyauni/1976-
dc.description.abstractFor a graph G = (V, E), a set S ⊆ V is a restrained dominating set if every vertex not in S is adjacent to a vertex in S and also to a vertex in V − S. The minimum cardinality of a restrained dominating set of G is called restrained domination number of G, denoted by γr(G). We investigate restrained domination number of some wheel related graphs.en_US
dc.language.isoenen_US
dc.publisherMalaya Journal of Matematik,en_US
dc.subjectDominating seten_US
dc.subjectrestrained dominating seten_US
dc.subjectrestrained domination number.en_US
dc.titleOn restrained domination number of some wheelen_US
dc.typeArticleen_US
Appears in Collections:01. Journal Articles

Files in This Item:
File Description SizeFormat 
On restrained domination number of some wheel.pdf1.43 MBAdobe PDFView/Open
Show simple item record


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