Corpus ID: 117810229

# Weakly connected domination critical graphs

@article{Lemanska2008WeaklyCD,
title={Weakly connected domination critical graphs},
author={Magdalena Lemanska and A. Patyk},
journal={Opuscula Mathematica},
year={2008},
volume={28},
pages={325-330}
}
• Published 2008
• Mathematics
• Opuscula Mathematica
• A dominating set $$D \subset V(G)$$ is a weakly connected dominating set in $$G$$ if the subgraph $$G[D]_w = (N_{G}[D],E_w)$$ weakly induced by $$D$$ is connected, where $$E_w$$ is the set of all edges with at least one vertex in $$D$$. The weakly connected domination number $$\gamma_w(G)$$ of a graph $$G$$ is the minimum cardinality among all weakly connected dominating sets in $$G$$. The graph is said to be weakly connected domination critical ($$\gamma_w$$-critical) if for each \(u, v \in V… CONTINUE READING
9 Citations
Weakly connected Roman domination in graphs
• Mathematics, Computer Science
• Discret. Appl. Math.
• 2019

#### References

SHOWING 1-4 OF 4 REFERENCES
On weakly connected domination in graphs
• Computer Science, Mathematics
• Discret. Math.
• 1997
• 67
Domination critical graphs
• Computer Science, Mathematics
• J. Comb. Theory, Ser. B
• 1983
• 165
• PDF
Connected domination critical graphs
• Mathematics, Computer Science
• Appl. Math. Lett.
• 2004
• 26
• PDF
Domination Numbers in Graphs with Removed Edge or Set of Edges
• 3
• PDF