Abstract
In an isolate-free graph G, a subset S of vertices 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 of G, denoted by \(\gamma _{t2}(G)\), is the minimum cardinality of a semitotal dominating set in G. Zhu et al. (Gr Combin 33, 1119–1130, 2017) proved that if \(G\notin \{K_4,N_2\}\) is a connected claw-free cubic graph of order n, then \(\gamma _{t2}(G)\le \frac{n}{3}\), which is sharp. They proposed the problem of characterizing the extremal graphs. We completely solve this problem. There are ten classes of graphs, three of which are infinite families of graphs.
Similar content being viewed by others
Data Availability
Not applicable.
Code Availability
Not applicable.
References
Chen, J., Xu, S.-J.: A characterization of 3-\(\gamma \)-critical graphs which are not bicritical. Inf. Process. Lett. 166, 106062 (2021)
Dong, Y.X., Shan, E.F., Kang, L.Y., Li, S.: Domination in intersecting hypergraphs. Discrete Appl. Math. 251, 155–159 (2018)
Favaron, O., Henning, M.A.: Paired-domination in claw-free cubic graphs. Gr. Combin. 20(4), 447–456 (2004)
Favaron, O., Henning, M.A.: Bounds on total domination in claw-free cubic graphs. Discrete Math. 308(16), 3491–3507 (2008)
Goddard, W., Henning, M.A., McPillan, C.A.: Semitotal domination in graphs. Util. Math. 94, 67–81 (2014)
Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Maecel Dekker Inc., New York (1998)
Henning, M.A.: Edge weighting functions on semitotal dominating sets. Gr. Combin. 33, 403–417 (2017)
Henning, M.A.: Bounds on domination parameters in graphs: a brief survey. Discuss. Math. Gr. Theory 42, 665–708 (2022)
Henning, M.A., Löwenstein, C.: Locating-total domination in claw-free cubic graphs. Discrete Math. 312, 3107–3116 (2012)
Henning, M.A., Marcon, A.J.: On matching and semitotal domination in graphs. Discrete Math. 324, 13–18 (2014)
Henning, M.A., Marcon, A.J.: Semitotal domination in claw-free cubic graphs. Ann. Comb. 20(4), 1–15 (2016)
Henning, M.A., Pandey, A.: Algorithmic aspects of semitotal domination in graphs. Theoret. Comput. Sci. 766, 46–57 (2019)
Henning, M.A., Yeo, A.: Total Domination in Graphs. Springer, New York (2013)
Henning, M.A., Kang, L., Shan, E., Yeo, A.: On matching and total domination in graphs. Discrete Math. 308, 2313–2318 (2008)
Southey, J., Henning, M.A.: On a conjecture on total domination in claw-free cubic graphs. Discrete Math. 310(21), 2984–2999 (2010)
Zhu, E., Liu, C.: On the semitotal domination number of line graphs. Discrete Appl. Math. 254, 295–298 (2019)
Zhu, E., Shao, Z., Xu, J.: Semitotal domination in claw-free cubic graphs. Gr. Combin. 33(5), 1119–1130 (2017)
Acknowledgements
The authors would like to express their gratitude to the referees for their valuable remarks and suggestions which improved the paper.
Funding
This work was funded in part by National Natural Science Foundation of China (Grants no. 12071194).
Author information
Authors and Affiliations
Contributions
All authors contributed to this paper.
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no Conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Chen, J., Wang, CX., Liang, YP. et al. A Characterization of Graphs with Semitotal Domination Number One-Third Their Order. Graphs and Combinatorics 40, 73 (2024). https://doi.org/10.1007/s00373-024-02800-w
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s00373-024-02800-w