Product Signed Domination in Graphs

Abstract

Let be a simple graph. The closed neighborhood of , denoted by , is the set . A function is a product signed dominating function, if for every vertex where . The weight of , denoted by , is the sum of the function values of all the vertices in . . The product signed domination number of is the minimum positive weight of a product signed dominating function. In this paper, we establish bounds on the product signed domination number and estimate product signed domination number for some standard graphs

Keywords

• graphs, product signed dominating function, product signed domination number