Abstract
A set S of vertices in an isolate-free graph G is a semitotal dominating set of G if it is a dominating set of G and every vertex in S is within distance 2 of another vertex of S. The semitotal domination number is the minimum cardinality of a semitotal dominating set of G, and is bounded below by the domination number and bounded above by the total domination number, arguably the two most important domination parameters. The upper semitotal domination number, \(\Gamma _{t2}(G)\), of G is the maximum cardinality of a minimal semitotal dominating set in G. If G is a connected graph with minimum degree \(\delta \ge 1\) and of order \(n \ge \delta + 2\), then we show that \(\Gamma _{t2}(G) \le n - \delta \), and that this bound is sharp for every fixed \(\delta \ge 1\). Using edge weighting functions on semitotal dominating sets we show that if we impose a regularity condition on a graph, then this upper bound on the upper semitotal domination number can be greatly improved. We prove that if G is a 2-regular graph on n vertices with no \(K_3\)-component, then \(\Gamma _{t2}(G) \le \frac{4}{7}n\), with equality if and only if every component of G is a cycle of length congruent to zero modulo 7. For \(k \ge 3\), we prove that if G is a k-regular graph on n vertices, then \(\Gamma _{t2}(G) \le \frac{1}{2}n\), and we characterize the infinite families of graphs that achieve equality in this bound.
Similar content being viewed by others
References
Brešar, B.: Vizing-like conjecture for the upper domination of Cartesian products of graphs—the proof. Electron. J. Combin. 12, 6 (2005)
Dorbec, P., Henning, M.A., Rall, D.F.: On the upper total domination number of Cartesian products of graphs. J. Combin. Optim. 16, 68–80 (2008)
Fang, Q.: On the computational complexity of upper total domination. Discr. Appl. Math. 136, 13–22 (2004)
Favaron, O., Henning, M.A.: Upper total domination in claw-free graphs. J. Graph Theory 44, 148–158 (2003)
Grobler, P.J.P., Mynhardt, C.M.: Vertex criticality for upper domination and irredundance. J. Graph Theory 37, 205–212 (2001)
Gutin, G., Zverovich, V.E.: Upper domination and upper irredundance perfect graphs. Discr. Math. 190, 95–105 (1998)
Goddard, W., Henning, M.A., McPillan, C.A.: Semitotal domination in graphs. Utilitas Math. 94, 67–81 (2014)
Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998)
Henning, M.A., Marcon, A.J.: On matching and semitotal domination in graphs. Discr. Math. 324, 13–18 (2014)
Henning, M.A., Marcon, A.J.: Semitotal Domination in Graphs: Partition and Algorithmic Results. Utilitas Math. (Accepted)
Henning, M.A., Marcon, A.J.: Vertices contained in all or in no minimum semitotal dominating set of a tree. Discuss. Math. Graph Theory 36(1), 71–93 (2016)
Henning, M.A., Marcon, A.J.: Semitotal domination in claw-free cubic graphs. Ann. Comb. 20(4), 799–813 (2016)
Henning, M.A., Löwenstein, C.: Locating-total domination in claw-free cubic graphs. Discr. Math. 312, 3107–3116 (2012)
Henning, M.A., Yeo, A.: Total domination in graphs (Springer Monographs in Mathematics) (2013). ISBN: 978-1-4614-6524-9 (Print) 978-1-4614-6525-6 (Online)
Marcon, A.J.: Semitotal domination in graphs. PhD dissertation, University of Johannesburg (2015)
Southey, J., Henning, M.A.: Edge weighting functions on dominating sets. J. Graph Theory 72, 346–360 (2013)
Zverovich, I.E., Zverovich, V.E.: A semi-induced subgraph characterization of upper domination perfect graphs. J. Graph Theory 31, 29–49 (1999)
Acknowledgements
The author expresses his sincere thanks to the anonymous referees for their meticulous and thorough reading of the paper, and for their remarks that helped improve the manuscript.
Author information
Authors and Affiliations
Corresponding author
Additional information
Research supported in part by the South African National Research Foundation and the University of Johannesburg.
Rights and permissions
About this article
Cite this article
Henning, M.A. Edge Weighting Functions on Semitotal Dominating Sets. Graphs and Combinatorics 33, 403–417 (2017). https://doi.org/10.1007/s00373-017-1769-4
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-017-1769-4