## 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, Γ _{t} _{2}(G) , of G is the maximum cardinality of a minimal semitotal dominating set in G. If G is a connected graph with minimum degree δ≥ 1 and of order n≥ δ+ 2 , then we show that Γ _{t} _{2}(G) ≤ n- δ, and that this bound is sharp for every fixed δ≥ 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 Γt2(G)≤47n, with equality if and only if every component of G is a cycle of length congruent to zero modulo 7. For k≥ 3 , we prove that if G is a k-regular graph on n vertices, then Γt2(G)≤12n, and we characterize the infinite families of graphs that achieve equality in this bound.

Original language | English |
---|---|

Pages (from-to) | 403-417 |

Number of pages | 15 |

Journal | Graphs and Combinatorics |

Volume | 33 |

Issue number | 2 |

DOIs | |

Publication status | Published - 1 Mar 2017 |

## Keywords

- Regular graphs
- Upper semitotal domination

## ASJC Scopus subject areas

- Theoretical Computer Science
- Discrete Mathematics and Combinatorics