Abstract
A paired-dominating set of a graph G = (V, E) with no isolated vertex is a dominating set of vertices whose induced subgraph has a perfect matching. The paired-domination number of G, denoted by γ pr (G), is the minimum cardinality of a paired-dominating set of G. The paired-domination subdivision number sd γpr (G) is the minimum number of edges that must be subdivided (each edge in G can be subdivided at most once) in order to increase the paired-domination number. In this paper we establish upper bounds on the paired-domination subdivision number and pose some problems and conjectures.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Chellali, M., Haynes, T.W.: Trees with unique minimum paired-dominating sets. Ars. Combin. 73, 3–12 (2004)
Favaron, O., Henning, M.A.: Paired domination in claw-free cubic graphs. Graphs Combin. 20, 447–456 (2004)
Favaron, O., Karami, H., Sheikholeslami, S.M.: Paired-domination number of a graph and its complement. Discrete Math. 308, 6601–6605 (2008)
Fitzatrick, S., Hartnell, B.: Paired-domination. Discuss. Math. Graph Theory 18, 63–72 (1998)
Haynes, T.W., Hedetniemi, S.T., van der Merwe, L.C.: Total domination subdivision numbers. J. Combin. Math. Combin. Comput. 44, 115–128 (2003)
Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of domination in graphs. Marcel Dekker, New York (1998)
Haynes, T.W., Slater, P.J.: Paired domination in graphs. Networks 32, 199–206 (1998)
Haynes, T.W., Slater, P.J.: Paired domination and paired-domatic number. Congr. Numer. 109, 65–72 (1995)
Haynes, T.W., Henning, M.A..: Trees with large paired-domination number. Utilitas Math. 71, 3–12 (2006)
Henning, M.A.: Graphs with large paired-domination number. J. Combin. Optim. 13, 61–78 (2007)
Henning, M.A., Plummer, M.D.: Vertices contained in all or in no minimum paired-dominating set of a tree. J. Combin. Optim. 10, 283–294 (2005)
Proffitt, K.E., Haynes, T.W., Slater, P.J.: Paired-domination in grid graphs. Congr. Numer. 150, 161–172 (2001)
Qiao, H., Kang, L., Cardei, M., Du, D.Z.: Paired-domination of trees. J. Global Optim. 25, 43–54 (2003)
Velammal, S.: Studies in graph theory: covering, independence, domination and related topics. Ph.D. Thesis, Manonmaniam Sundaranar University, Tirunelveli (1997)
West, D.B.: Introduction to Graph Theory. Prentice-Hall, Inc, (2000)
Author information
Authors and Affiliations
Corresponding author
Additional information
S.M. Sheikholeslami: Research supported by the Research Office of Azarbaijan University of Tarbiat Moallem
Rights and permissions
About this article
Cite this article
Favaron, O., Karami, H. & Sheikholeslami, S.M. Paired-Domination Subdivision Numbers of Graphs. Graphs and Combinatorics 25, 503–512 (2009). https://doi.org/10.1007/s00373-005-0871-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-005-0871-1