Graphs With Semitotal Domination Number Half Their Order
Year: 2024
Type: article
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. Goddard, Henning and McPillan [‘Semitotal domination in graphs’, Utilitas Math.94 (2014), 67–81] characterised the trees and graphs of minimum degree 2 with semitotal domination number half their order. In this paper, we characterise all graphs whose semitotal domination number is half their order.
Authors: JIE CHEN, SHOU-JUN XU
Institutions: Lanzhou University, Minnan Normal University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $3,450
OpenAlex ID: W4402521916