dc.contributor.author |
Thakkar, D. K |
|
dc.contributor.author |
Jamvecha, P |
|
dc.date.accessioned |
2024-11-25T05:46:52Z |
|
dc.date.available |
2024-11-25T05:46:52Z |
|
dc.date.issued |
2019 |
|
dc.identifier.citation |
Thakkar, D. K., & Jamvecha, P. (2019). About m-domination number of graphs. Malaya Journal of Matematik, 7(02), 177-181. |
en_US |
dc.identifier.uri |
http://10.9.150.37:8080/dspace//handle/atmiyauni/1992 |
|
dc.description.abstract |
In this paper, we have defined the concept of m-dominating set in graphs. In order to define this concept we have used the notion of m-adjacent vertices. We have also defined the concepts of minimal m-dominating set, minimum m-dominating set and m-domination number which is the minimum cardinality of an m-dominating set. We prove that the complement of a minimal m-dominating set is an m-dominating set. Also we prove a necessary and sufficient condition under which the m-domination number increases or decreases when a vertex is removed from the graph. Further we have also studied the concept of m-removing a vertex from the graph and we prove that the m-removal of a vertex from the graph always increases or does not change the m-domination
number. Some examples have also been given. |
en_US |
dc.language.iso |
en |
en_US |
dc.publisher |
Malaya Journal of Matematik, |
en_US |
dc.subject |
m-dominating set |
en_US |
dc.subject |
minimal m-dominating set |
en_US |
dc.subject |
minimum m-dominating set |
en_US |
dc.subject |
private m-neighbourhood of a vertex, |
en_US |
dc.title |
About m-domination number of graphs |
en_US |
dc.type |
Article |
en_US |