A note on the lower bounds of signed domination number of a graph
Discrete Mathematics
Extremal graphs for inequalities involving domination parameters
Discrete Mathematics
On signed edge domination numbers of graphs
Discrete Mathematics
Graph Theory With Applications
Graph Theory With Applications
Upper signed k-domination in a general graph
Information Processing Letters
Hi-index | 0.04 |
Let @c"s^'(G) (@c"l^'(G), resp.) be the number of (local) signed edge domination of a graph G [B. Xu, On signed edge domination numbers of graphs, Discrete Math. 239 (2001) 179-189]. In this paper, we prove mainly that @c"s^'(G)==4), and pose several open problems and conjectures.