Bounds on the signed domination number of a graph

Let G = (V, E) be a simple graph on vertex set V and define a function f : V {-1, 1}. The function f is a signed dominating function if for every vertex x V, the closed neighborhood of

• Type: Journal
• Year: 2002
• Where: ENDM
• Authors: Ruth Haas, Thomas B. Wexler
• Keywords: ENDM 2002, Simple Graph