Please use this identifier to cite or link to this item: http://10.9.150.37:8080/dspace//handle/atmiyauni/1842
Title: Equitable restrained domination number of some
Authors: Vaidya, S. K.
Ajani, P. D.
Keywords: Dominating setequitable dominating set
equitable dominating set
equitable restrained dominating set
equitable restrained domination number.
Issue Date: 2020
Publisher: Malaya Journal of Matematik
Citation: Vaidya, S. K., & Ajani, P. D. (2020). Equitable restrained domination number of some graphs. Malaya Journal of Matematik, 8(03), 1045-1049.
Abstract: A dominating set is said to be a restrained dominating set of graph if every vertex not in is adjacent to a vertex in and also to a vertex in . A set is called an equitable dominating set if for every vertex , there exist a vertex such that and . A dominating set 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 , denoted by . We investigate parameter for some standard graphs and also establish some characterizations.
URI: http://10.9.150.37:8080/dspace//handle/atmiyauni/1842
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 full item record


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