Skip to main content
SpringerLink
Log in

Minimal Double Dominating Sets in Trees

  • Conference paper
Frontiers in Algorithmics (FAW 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8497))

Included in the following conference series:

  • 929 Accesses

Abstract

We provide an algorithm for listing all minimal double 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 double dominating sets. We also show that this bound is tight.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bród, D., Skupień, Z.: Trees with extremal numbers of dominating sets. Australasian Journal of Combinatorics 35, 273–290 (2006)

    MATH  MathSciNet  Google Scholar 

  2. 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)

    MATH  MathSciNet  Google Scholar 

  3. 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)

    Chapter  Google Scholar 

  4. 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 p. (2009)

    Google Scholar 

  5. Fomin, F., Kratsch, D.: Exact Exponential Algorithms. Springer, Berlin (2010)

    Book  MATH  Google Scholar 

  6. Harary, F., Haynes, T.: Double domination in graphs. Ars Combinatoria 55, 201–213 (2000)

    MATH  MathSciNet  Google Scholar 

  7. Haynes, T., Hedetniemi, S., Slater, P.: Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998)

    MATH  Google Scholar 

  8. Haynes, T., Hedetniemi, S., Slater, P. (eds.): Domination in Graphs: Advanced Topics. Marcel Dekker, New York (1998)

    MATH  Google Scholar 

  9. 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)

    Chapter  Google Scholar 

  10. Krzywkowski, M.: Trees having many minimal dominating sets. Information Processing Letters 113, 276–279 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  11. Lawler, E.: A note on the complexity of the chromatic number problem. Information Processing Letters 5, 66–67 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  12. Moon, J., Moser, L.: On cliques in graphs. Israel Journal of Mathematics 3, 23–28 (1965)

    Article  MATH  MathSciNet  Google Scholar 

  13. Wilf, H.: The number of maximal independent sets in a tree. SIAM Journal on Algebraic and Discrete Methods 7, 125–130 (1986)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, Polish Academy of Sciences, Poland

    Marcin Krzywkowski

Authors
  1. Marcin Krzywkowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Texas A&M University, USA

    Jianer Chen

  2. Cornell University, USA

    John E. Hopcroft

  3. School of Information Science and Engineering, Central South University, 410083, Changsha, China

    Jianxin Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Krzywkowski, M. (2014). Minimal Double Dominating Sets in Trees. In: Chen, J., Hopcroft, J.E., Wang, J. (eds) Frontiers in Algorithmics. FAW 2014. Lecture Notes in Computer Science, vol 8497. Springer, Cham. https://doi.org/10.1007/978-3-319-08016-1_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08016-1_14

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08015-4

  • Online ISBN: 978-3-319-08016-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation