Abstract Paper


Journal of Computational Mathametica

Title : Restrained Domination Number of Some Path Related Graphs
Author(s) : 1 S. K. Vaidya, and 2 P. D. Ajani,
Article Information : , 114-121
Affiliation(s) : 1 Department of Mathematics, Saurashtra University, Rajkot, Gujarat, India - 360005
: 2 Atmiya Institute of Technology and Science, Rajkot, India - 360005

Abstract :

A dominating subset S of 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 is the minimum cardinality of a restrained dominating set of G.


Keywords : Dominating set, restrained dominating set, restrained domination number.
Document Type : Research Paper
Publication date : May 20, 2017