Minimum odd neighbourhood covers for trees
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.
KeywordsPolynomial Time Cellular Automaton Mathematical Intelligencer Adjacent Vertex Minimum Cardinality
Unable to display preview. Download preview PDF.
- J.A. Bondy and U.S.R. Murty, Graph Theory with Applications, Macmillan Press, London (1976).Google Scholar
- R.W. Dawes, Neighbourhood covers for trees, Queen's University Technical Report 90-266.Google Scholar
- F. Galvin, Solution, Mathematical Intelligencer 11 No. 2(1989), 32.Google Scholar
- S.T. Hedetniemi and R. Laskar, Recent results and open problems in domination theory,Technical Report 543, Clemson University, 1987.Google Scholar
- N. Margolus, Emulating physics with cellular automata, Colloquium, Queen's University, 1989.Google Scholar
- K. Sutner, Linear automata on graphs, to appear.Google Scholar