42 search results - page 1 / 9 » Bounds on the signed domination number of a graph |
ENDM
2002
13 years 4 months ago
2002
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 neighbor...
DM
2008
13 years 4 months ago
2008
In this paper, we provide an upper bound for the k-tuple domination number that generalises known upper bounds for the double and triple domination numbers. We prove that for any ...
DM
2010
13 years 4 months ago
2010
For a graph G, a signed domination function of G is a two-colouring of the vertices of G with colours +1 and
EJC
2008
13 years 4 months ago
2008
COMBINATORICS
2007
13 years 4 months ago
2007
