## Abstract

In this paper, we continue the study of semitotal domination in graphs in [Discrete Math. 324, 13–18 (2014)]. A set S of vertices in 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, γ_{t} _{2}(G) , is the minimum cardinality of a semitotal dominating set of G. This domination parameter is squeezed between arguably the two most important domination parameters; namely, the domination number, γ(G) , and the total domination number, γ_{t}(G). We observe that γ(G) ≤ γ_{t} _{2}(G) ≤ γ_{t}(G). A claw-free graph is a graph that does not contain K1,3 as an induced subgraph. We prove that if G is a connected, claw-free, cubic graph of order n≥ 10 , then γ_{t} _{2}(G) ≤ 4 n/ 11.

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

Pages (from-to) | 799-813 |

Number of pages | 15 |

Journal | Annals of Combinatorics |

Volume | 20 |

Issue number | 4 |

DOIs | |

Publication status | Published - 1 Dec 2016 |

## Keywords

- claw-free
- cubic
- semitotal domination
- total domination

## ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics