Abstract
We provide an algorithm for listing all minimal 2-dominating sets of a tree of order n in time \(\mathcal{O}(1.3248^n)\). This implies that every tree has at most 1.3248n minimal 2-dominating sets. We also show that this bound is tight.
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
Björklund, A., Husfeldt, T.: Inclusion-exclusion algorithms for counting set partitions. In: Proceedings of FOCS, pp. 575–582 (2006)
Blidia, M., Favaron, O., Lounes, R.: Locating-domination, 2-domination and independence in trees. Australasian Journal of Combinatorics 42, 309–316 (2008)
Bród, D., Skupień, Z.: Trees with extremal numbers of dominating sets. Australasian Journal of Combinatorics 35, 273–290 (2006)
Bród, D., Włoch, A., Włoch, I.: On the number of minimal dominating sets including the set of leaves in trees. International Journal of Contemporary Mathematical Sciences 4, 1739–1748 (2009)
Couturier, J.-F., Heggernes, P., van’t Hof, P., Kratsch, D.: Minimal dominating sets in graph classes: combinatorial bounds and enumeration. In: Bieliková, M., Friedrich, G., Gottlob, G., Katzenbeisser, S., Turán, G. (eds.) SOFSEM 2012. LNCS, vol. 7147, pp. 202–213. Springer, Heidelberg (2012)
Eppstein, D.: Small maximal independent sets and faster exact graph coloring. Journal of Graph Algorithms and Applications 7, 131–140 (2003)
Fink, J., Jacobson, M.: n-domination in graphs. In: Graph Theory with Applications to Algorithms and Computer Science, pp. 282–300. Wiley, New York (1985)
Fomin, F., Grandoni, F., Pyatkin, A., Stepanov, A.: Combinatorial bounds via measure and conquer: bounding minimal dominating sets and applications. ACM Transactions on Algorithms 5, article 9, 17 (2009)
Fomin, F., Kratsch, D.: Exact Exponential Algorithms. Springer, Berlin (2010)
Fujisawa, J., Hansberg, A., Kubo, T., Saito, A., Sugita, M., Volkmann, L.: Independence and 2-domination in bipartite graphs. Australasian Journal of Combinatorics 40, 265–268 (2008)
Haynes, T., Hedetniemi, S., Slater, P.: Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998)
Haynes, T., Hedetniemi, S., Slater, P. (eds.): Domination in Graphs: Advanced Topics. Marcel Dekker, New York (1998)
Kanté, M., Limouzy, V., Mary, A., Nourine, L.: Enumeration of minimal dominating sets and variants. In: Owe, O., Steffen, M., Telle, J.A. (eds.) FCT 2011. LNCS, vol. 6914, pp. 298–309. Springer, Heidelberg (2011)
Koivisto, M.: An \(\mathcal{O}(2^n)\) algorithm for graph coloring and other partitioning problems via inclusion-exclusion. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 583–590. IEEE (2006)
Krzywkowski, M.: Trees having many minimal dominating sets. Information Processing Letters 113, 276–279 (2013)
Lawler, E.: A note on the complexity of the chromatic number problem. Information Processing Letters 5, 66–67 (1976)
Moon, J., Moser, L.: On cliques in graphs. Israel Journal of Mathematics 3, 23–28 (1965)
Shaheen, R.: Bounds for the 2-domination number of toroidal grid graphs. International Journal of Computer Mathematics 86, 584–588 (2009)
Wilf, H.: The number of maximal independent sets in a tree. SIAM Journal on Algebraic and Discrete Methods 7, 125–130 (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krzywkowski, M. (2013). An Algorithm for Listing All Minimal 2-Dominating Sets of a Tree. In: Fellows, M., Tan, X., Zhu, B. (eds) Frontiers in Algorithmics and Algorithmic Aspects in Information and Management. Lecture Notes in Computer Science, vol 7924. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38756-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-38756-2_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38755-5
Online ISBN: 978-3-642-38756-2
eBook Packages: Computer ScienceComputer Science (R0)