Skip to main content
Springer Nature Link
Log in

Minimum odd neighbourhood covers for trees

  • Track 4: Algorithms
  • Conference paper
  • First Online:
Computing in the 90's (Great Lakes CS 1989)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 507))

Included in the following conference series:

  • 113 Accesses

Abstract

Finding the smallest odd neighbourhood cover (odd N-cover) of an arbitrary graph is known to be NP-complete. We observe that there exist trees with an exponential number of odd N-covers, and present a polynomial-time algorithm to determine a minimum cardinality odd N-cover of a tree.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.A. Bondy and U.S.R. Murty, Graph Theory with Applications, Macmillan Press, London (1976).

    Google Scholar 

  2. R.W. Dawes, Neighbourhood covers for trees, Queen's University Technical Report 90-266.

    Google Scholar 

  3. F. Galvin, Solution, Mathematical Intelligencer 11 No. 2(1989), 32.

    Google Scholar 

  4. S.T. Hedetniemi and R. Laskar, Recent results and open problems in domination theory,Technical Report 543, Clemson University, 1987.

    Google Scholar 

  5. N. Margolus, Emulating physics with cellular automata, Colloquium, Queen's University, 1989.

    Google Scholar 

  6. K. Sutner, Linear cellular automata and the garden-of-eden, Mathematical Intelligencer 11 No. 2(1989), 49–53.

    Article  MATH  MathSciNet  Google Scholar 

  7. K. Sutner, Linear automata on graphs, to appear.

    Google Scholar 

  8. S. Wolfram, Statistical mechanics and cellular automata, Rev. Modern Physics 55(1983), 601–644.

    Article  MathSciNet  Google Scholar 

  9. S. Wolfram, Computation theory of cellular automata, Comm. Math. Physics 96(1984), 15–57.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Queen's University, Kingston, Ontario

    Robin W. Dawes

Authors
  1. Robin W. Dawes
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Naveed A. Sherwani Elise de Doncker John A. Kapenga

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dawes, R.W. (1991). Minimum odd neighbourhood covers for trees. In: Sherwani, N.A., de Doncker, E., Kapenga, J.A. (eds) Computing in the 90's. Great Lakes CS 1989. Lecture Notes in Computer Science, vol 507. Springer, New York, NY. https://doi.org/10.1007/BFb0038488

Download citation

  • DOI: https://doi.org/10.1007/BFb0038488

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-97628-0

  • Online ISBN: 978-0-387-34815-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics