Abstract
Let G= (V, E) be a graph without isolated vertices. A set S⊂V is a paired-dominating set if it dominates V and the subgraph induced by S,〈S〉, contains a perfect matching. The paired-domination number γp(G) is defined to be the minimum cardinality of a paired-dominating set S in G. In this paper, we present a linear-time algorithm computing the paired-domination number for trees and characterize trees with equal domination and paired-domination numbers.
This is a preview of subscription content, access via your institution.
References
Haynes, T.W. and Slater, P.J. (1998), Paired-domination in graphs. Networks 32, 199–206.
Haynes, T.W., Hedetniemi, S.T. and Slater, P.J. (1998), Fundamentals of Domination in Graphs. Marcel Dekker, New York.
Haynes, T.W., Hedetniemi, S.T. and Slater, P.J. (1998), Domination in Graphs: Advanced Topics. Marcel Dekker, New York.
Hattingh, J.H. and Henning, M.A. (2000), Characterizations of trees with equal domination parameters. Journal of Graph Theory 34, 142–153.
Cockayne, E.J., Favaron, O., Mynhardt, C.M. and Puech, J. (2000), A characterization of (γ, i)-trees. Journal of Graph Theory 34, 277–292.
Mynhardt, C.M. (1999), Vertices contained in every minimum dominating set of a tree. Journal of Graph Theory 31, 163–177.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Qiao, H., Kang, L., Cardei, M. et al. Paired-domination of Trees. Journal of Global Optimization 25, 43–54 (2003). https://doi.org/10.1023/A:1021338214295
Issue Date:
DOI: https://doi.org/10.1023/A:1021338214295
Keywords
- Real Function
- Perfect Match
- Minimum Cardinality
- Equal Domination