Abstract
A set S of vertices of a graph G=(V,E) without isolated vertex is a total dominating set if every vertex of V(G) is adjacent to some vertex in S. The total domination number γ t (G) is the minimum cardinality of a total dominating set of G. The total domination subdivision number \(\mathrm {sd}_{\gamma_{t}}(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 total domination number. In this paper we prove that \(\mathrm {sd}_{\gamma_{t}}(G)\leq\gamma_{t}(G)+1\) for some classes of graphs.
Similar content being viewed by others
References
Archdeacon D, Ellis-Monaghan J, Fisher D, Froncek D, Lam PCB, Seager S, Wei B, Yuster R (2004) Some remarks on domination. J Graph Theory 46:207–210
Favaron O, Karami H, Sheikholeslami SM (2007) Total domination and total domination subdivision numbers of graphs. Australas J Comb 38:229–235
Favaron O, Karami H, Sheikholeslami SM (2008a) Total domination and total domination subdivision number of a graph and its complement. Discrete Math 308:4018–4023
Favaron O, Karami H, Sheikholeslami SM (2008b) Bounding the total domination subdivision number of a graph in terms of its order (submitted)
Favaron O, Karami H, Khoeilar R, Sheikholeslami SM (2008c) A new upper bound for total domination subdivision numbers. Graphs Comb (to appear)
Haynes TW, Hedetniemi ST, van der Merwe LC (2003) Total domination subdivision numbers. J Comb Math Comb Comput 44:115–128
Haynes TW, Henning MA, Hopkins LS (2004a) Total domination subdivision numbers of graphs. Discuss Math Graph Theory 24:457–467
Haynes TW, Henning MA, Hopkins LS (2004b) Total domination subdivision numbers of trees. Discrete Math 286:195–202
Henning MA, Kang L, Shan E, Yeo A (2008) On matching and total domination in graphs. Discrete Math 308:2313–2318
Karami H, Khodkar A, Sheikholeslami SM (2008a) An upper bound for total domination subdivision numbers of graphs, Ars Comb (to appear)
Karami H, Khodkar A, Khoeilar R, Sheikholeslami SM (2008b) Trees whose total domination subdivision number is one. Bull Inst Comb Appl 53:57–67
Velammal S (1997) Studies in graph theory: covering, independence, domination and related topics. PhD thesis, Manonmaniam Sundaranar University, Tirunelveli
West DB (2000) Introduction to graph theory. Prentice-Hall, Englewood Cliffs
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Favaron, O., Karami, H., Khoeilar, R. et al. On the total domination subdivision number in some classes of graphs. J Comb Optim 20, 76–84 (2010). https://doi.org/10.1007/s10878-008-9193-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-008-9193-6