On the Chromatic Restrained Domination Number of Strong Product of Graphs

Abstract

Let  be a graph. A subset  of  is said to be a chromatic restrained dominating set (or crd-set) if  is a restrained dominating set and . The minimum cardinality taken over all minimal chromatic restrained dominating sets is called the chromatic restrained domination number of  and is denoted by . In this paper, we obtain the chromatic restrained domination number for the strong product of some standard graphs.