Abstract
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.
This work is supported by the National Natural Science Foundation of China under Grant (61103033,61128006 ), the Doctoral Discipline Foundation of Higher Education Institution of China under Grant (20090162110056).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dunbar, J., Hedetniemi, S., Henning, M., Slater, P.: Signed domination in graphs. Graph Theory, Combinatorics and Applications, 311–322 (1995)
Hattingh, J., Henning, M., Slater, P.: The algorithmic complexity of signed domination in graphs. Australasian Journal of Combinatorics 12, 101–112 (1995)
Hass, R., Wexler, T.: Signed domination numbers of a graph and its complement. Discrete Math. 283, 87–92 (2004)
Zelinka, B.: Signed total domination number of a graph. Czechoslovak Math. 51, 225–229 (2001)
Matousek, J.: On the signed domination in graphs. Combinatorica 20, 103–108 (2000)
Robertson, N., Seymour, P.D.: Graph minors X. Obstructions to tree decomposition. J. of Combinatorial Theory, Series B 52, 153–190 (1991)
Zhang, Z., Xu, B., Li, Y., Liu, L.: A note on the lower bounds of signed domination number of a graph. Discrete Math. 195, 295–298 (1999)
Favaron, O.: Signed domination in regular graphs. Discrete Math. 158, 287–293 (1996)
Kloks, T. (ed.): Treewidth: Computations and Approximations. LNCS, vol. 842. Springer, Heidelberg (1994)
Bodlaender, H.L.: Treewidth: Algorithmic Techniques and Results. In: Privara, I., Ružička, P. (eds.) MFCS 1997. LNCS, vol. 1295, pp. 19–36. Springer, Heidelberg (1997)
Henning, M.A., Slater, P.J.: Irregularities relating domination parameters in cubic graphs. Discrete Mathematics 158, 87–98 (1996)
Henning, M.A.: Domination in regular graphs. Ars Combinatoria 43, 263–271 (1996)
Demaine, E.D., Fomin, F.V., Thilikos, D.M.: Bidimensional parameters and local treewidth. SIAM J. Disc. Math. 18(3), 501–511 (2004)
Alber, J., Fellows, M., Niedermeier, R.: Polynomial time data reduction for dominating set. J. ACM 51, 363–384 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zheng, Y., Wang, J., Feng, Q., Chen, J. (2012). FPT Results for Signed Domination. In: Agrawal, M., Cooper, S.B., Li, A. (eds) Theory and Applications of Models of Computation. TAMC 2012. Lecture Notes in Computer Science, vol 7287. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29952-0_53
Download citation
DOI: https://doi.org/10.1007/978-3-642-29952-0_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29951-3
Online ISBN: 978-3-642-29952-0
eBook Packages: Computer ScienceComputer Science (R0)