Unique Enresdowed Graphs
P. Sumathi, R. Esther Felicia · International Journal of Innovative Research in Applied Sciences and Engineering · 2017
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.