S. K. Vaidya 1 * and P. D. Ajani 2
Author Address :
1 Department of Mathematics, Saurashtra University, Rajkot - 360 005, Gujarat, India
2 Department of Mathematics, Atmiya University, Rajkot-360005, Gujarat, India.
For a graph $G=(V,E)$, a set $S subseteq V$ is a restrained dominating set if every vertex not in $S$ is adjacent to a vertex in $S$ and also to a vertex in $V-S$. The minimum cardinality of a restrained dominating set of $G$ is called restrained domination number of $G$, denoted by $gamma_r (G)$. We investigate restrained domination number of some wheel related graphs.
Dominating set, restrained dominating set, restrained domination number.
Article Info :
Received : September 12, 2018; Accepted : January 29, 2019.