Vol. 1 No. 1 (2017): Vol 1, Iss 1, Year 2017

Restrained Domination Number of Some Path Related Graphs

Vaidya S K
Department of Mathematics, Saurashtra University, Rajkot, Gujarat, India - 360005
Ajani P D
Atmiya Institute of Technology and Science, Rajkot, India - 360005
Published December 30, 2018
  • Dominating set, restrained dominating set, restrained domination number
How to Cite
S K, V., & P D, A. (2018). Restrained Domination Number of Some Path Related Graphs. Journal of Computational Mathematica, 1(1), 123-128. https://doi.org/10.26524/cm10


A dominating set S ⊆ V (G)of a graph G is called restrained dominating set if every vertex in V (G) - S is adjacent to a vertex in S and to a vertex in V (G) - S. The restrained domination number of G, denoted by γ_r (G), is the minimum cardinality of a restrained dominating set of G.


Download data is not yet available.