Graph minors: X. obstructions to tree-decomposition
Journal of Combinatorial Theory Series B
Inequalities relating domination parameters in cubic graphs
Discrete Mathematics
Signed domination in regular graphs
Discrete Mathematics
A note on the lower bounds of signed domination number of a graph
Discrete Mathematics
Treewidth: Algorithmoc Techniques and Results
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Polynomial-time data reduction for dominating set
Journal of the ACM (JACM)
Bidimensional Parameters and Local Treewidth
SIAM Journal on Discrete Mathematics
Hi-index | 0.00 |
A function f :v →{−1,+1} defined on the vertices of a graph G is a signed dominating function if the sum of its function values over any closed neighborhood is at least one. The weight of a signed dominating function is f (V )=∑f (v ), over all vertices v ∈V . The signed domination number of a graph G , denoted by γ s (G ), equals the minimum weight of a signed dominating function of G . The decision problem corresponding to the problem of computing γ s is an important NP-complete problem derived from social network. A signed dominating set is a set of vertices assigned the value +1 under the function f in the graph. In this paper, we give some fixed parameter tractable results for signed dominating set problem, specifically the kernels for signed dominating set problem on general and special graphs. These results generalize the parameterized algorithm for this problem. Furthermore we propose a parameterized algorithm for signed dominating set problem on planar graphs.