Minimum odd neighbourhood covers for trees

  • Robin W. Dawes
Track 4: Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 507)


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.


Polynomial Time Cellular Automaton Mathematical Intelligencer Adjacent Vertex Minimum Cardinality 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    J.A. Bondy and U.S.R. Murty, Graph Theory with Applications, Macmillan Press, London (1976).Google Scholar
  2. [2]
    R.W. Dawes, Neighbourhood covers for trees, Queen's University Technical Report 90-266.Google Scholar
  3. [3]
    F. Galvin, Solution, Mathematical Intelligencer 11 No. 2(1989), 32.Google Scholar
  4. [4]
    S.T. Hedetniemi and R. Laskar, Recent results and open problems in domination theory,Technical Report 543, Clemson University, 1987.Google Scholar
  5. [5]
    N. Margolus, Emulating physics with cellular automata, Colloquium, Queen's University, 1989.Google Scholar
  6. [6]
    K. Sutner, Linear cellular automata and the garden-of-eden, Mathematical Intelligencer 11 No. 2(1989), 49–53.zbMATHMathSciNetCrossRefGoogle Scholar
  7. [7]
    K. Sutner, Linear automata on graphs, to appear.Google Scholar
  8. [8]
    S. Wolfram, Statistical mechanics and cellular automata, Rev. Modern Physics 55(1983), 601–644.MathSciNetCrossRefGoogle Scholar
  9. [9]
    S. Wolfram, Computation theory of cellular automata, Comm. Math. Physics 96(1984), 15–57.zbMATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Robin W. Dawes
    • 1
  1. 1.Queen's UniversityKingston

Personalised recommendations