Abstract
A dominating set D ⊆ 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 having at least one vertex in D. Weakly connected domination number γw (G) of a graph G is the minimum cardinality among all weakly connected dominating sets in G. A graph G is said to be weakly connected domination stable or just γw -stable if γw (G) = γ w (G + e) for every edge e belonging to the complement Ḡ of G. We provide a constructive characterization of weakly connected domination stable trees.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D. P. Sumner, P. Blitch: Domination critical graphs. J. Combin. Theory Ser. B 34 (1983), 65–76.
J. E. Dunbar, J. W. Grossman, J. H. Hattingh, S. T. Hedetniemi and A. McRae: On weakly-connected domination in graphs. Discrete Mathematics 167–168 (1997), 261–269.
M. A. Henning: Total domination excellent trees. Discrete Mathematics 263 (2003), 93–104.
X. Chen, L. Sun and D. Ma: Connected domination critical graphs. Applied Mathematics Letters 17 (2004), 503–507.
M. Lemańska: Domination numbers in graphs with removed edge or set of edges. 25 (2005), 51–56.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Lemańska, M., Raczek, J. Weakly connected domination stable trees. Czech Math J 59, 95–100 (2009). https://doi.org/10.1007/s10587-009-0007-5
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10587-009-0007-5