Please use this identifier to cite or link to this item: http://10.9.150.37:8080/dspace//handle/atmiyauni/1978
Full metadata record
DC FieldValueLanguage
dc.contributor.authorVaidya, S. K.-
dc.contributor.authorjaAni, P. D.-
dc.date.accessioned2024-11-24T07:12:17Z-
dc.date.available2024-11-24T07:12:17Z-
dc.date.issued2020-
dc.identifier.urihttp://10.9.150.37:8080/dspace//handle/atmiyauni/1978-
dc.description.abstractA dominating set S ⊆ V is said to be a restrained dominating set of graph G if every vertex not in S is adjacent to a vertex in S and also to a vertex in V − S. A set S ⊆ V is called an equitable dominating set if for every vertex v ∈ V − S, there exist a vertex u ∈ S such that uv ∈ E and |deg(u) − deg(v)| ≤ 1. A dominating set S is called an equitable restrained dominating set if it is both restrained and equitable. The minimum cardinality of an equitable restrained dominating set is called equitable restrained domination number of G, denoted by γe r (G). We investigate γe r (G) parameter for some standard graphs and also establish some characterizations.en_US
dc.language.isoenen_US
dc.publisherMalaya Journal of Matematiken_US
dc.subjectDominating seten_US
dc.subjectequitable dominating seten_US
dc.subjectequitable restrained dominating seten_US
dc.subjectequitable restrained dominationen_US
dc.titleEquitable restrained domination number of some graphsen_US
dc.typeArticleen_US
Appears in Collections:01. Journal Articles

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


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