Bounds on several versions of restrained domination number

Authors

  • Babak Samadi Arak University
  • Hamid R Golmohammadi Department of Mathematics University of Tafresh, Tafresh, IRI
  • Abdollah Khodkar Department of Mathematics University of West Georgia Carrollton, GA 30118, USA

DOI:

https://doi.org/10.11575/cdm.v12i1.62175

Keywords:

restrained domination, restrained double domination, total restrained domination

Abstract

We investigate several versions of restrained

domination numbers and present new bounds on these parameters. We generalize the

concept of restrained domination and improve some well-known bounds in the literature.

In particular, for a graph GG of order nn and minimum degree δ3δ3, we prove that

the restrained double domination number of GG is at most nδ+1nδ+1. In addition,

for a connected cubic graph GG of order nn we show that

the total restrained domination number of GG is at least n/3n/3 and

the restrained double domination number of GG is at least n/2n/2.

Downloads

Published

2017-09-27

Issue

Section

Articles