This copyright statement was adapted from the statement for the University of Calgary Repository and from the statement for the Electronic Journal of Combinatorics with permission. The copyright policy for Contributions to Discrete Mathematics CDM is changed for all articles appearing in issues of the journal starting from Volume 15 Number 3. The author s agree that the journal may translate, without changing the content the material, to any medium or format for the purposes of preservation. The author s also agree that the journal may keep more than one copy of the article for the purposes of security, back-up, and preservation. In granting the journal this license the author s warrant that the work is their original work and that they have the right to grant the rights contained in this license.
Skip to search Skip to main content. Reporting from:. Your name. Your email. Send Cancel.
A set D of vertices in a graph G is a dominating set of G if every vertex outside D is adjacent in G to some vertex in D. A set D of vertices in G is a semitotal dominating set of G if D is a dominating set of G and every vertex in D is within distance 2 from another vertex of D. Given a graph G and a positive integer k , the semitotal domination problem is to decide whether G has a semitotal dominating set of cardinality at most k.