Unique Enresdowed Graphs
DOI:
https://doi.org/10.29027/IJIRASE.v1.i2.2017.66-72Keywords:
Dominating set, Domination number, Restrained Domination, Private Neighbour, enresdowed graphsAbstract
Let G = (V, E) be a non empty, finite, simple graph. k - γr enresdowed graph is one in which every restrained dominating set of cardinality k contains a minimum restrained dominating set. In this paper, we discovered a few outcomes for the k - γr enresdowed graph related to private neighborhood.
Additional Files
Published
15-08-2017
Issue
Section
Articles