Restrained Step Domination Number for Some Amusing Product Graph of Paths and Cycle

Abstract

G. Mahadevan, et, al., introduced the concept of restrained step domination number of a graph. A set of a graph G is said to be restrained step dominating set, if is the restrained dominating set and is a perfect matching. The minimum cardinality taken over all the restrained step dominating set is called the restrained step domination number of G and is denoted by (G). In this paper we explore this parameter for some product graph of path and cycle.