Amy A. Laja

Certified Weakly Connected Domination in Graphs.

Let G be a simple connected graph. We introduce certified weakly connected domination, where each vertex in a weakly connected dominating set S has either zero or at least two neighbors outside S. We establish fundamental relationships and determine the certified weakly connected domination number \gamma^{wc}_{cer}(G)...