JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | Vaidya, S. K. | |
| dc.contributor.author | Ajani, P. D. | |
| dc.date.accessioned | 2024-11-21T06:46:15Z | |
| dc.date.available | 2024-11-21T06:46:15Z | |
| dc.date.issued | 2020 | |
| dc.identifier.citation | Vaidya, S. K., & Ajani, P. D. (2020). Equitable restrained domination number of some graphs. Malaya Journal of Matematik, 8(03), 1045-1049. | en_US |
| dc.identifier.uri | http://10.9.150.37:8080/dspace//handle/atmiyauni/1842 | |
| dc.description.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. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Malaya Journal of Matematik | en_US |
| dc.subject | Dominating setequitable dominating set | en_US |
| dc.subject | equitable dominating set | en_US |
| dc.subject | equitable restrained dominating set | en_US |
| dc.subject | equitable restrained domination number. | en_US |
| dc.title | Equitable restrained domination number of some | en_US |
| dc.type | Article | en_US |
