RESILIENT DOMINATION IN GRAPHS
A resilient dominating set in a graph is a dominating set in which each vertex has at least one neighbor within the set and at least one neighbor outside the set, and the weakly induced subgraph of the set is connected. The smallest cardinality of such a set is the resilient domination number. This paper establishes fu...