Sciweavers

ENDM   2002
Wall of Fame | Most Viewed ENDM-2002 Paper
ENDM
2002
134views more  ENDM 2002»
13 years 11 months ago
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 neighbor...
Ruth Haas, Thomas B. Wexler
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
IdReadViewsTitleStatus
1Download preprint from source134
2Download preprint from source113
3Download preprint from source109
4Download preprint from source107
5Download preprint from source97
6Download preprint from source91
7Download preprint from source86
8Download preprint from source84
9Download preprint from source74
10Download preprint from source47