| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4650978 | Discrete Mathematics | 2007 | 9 Pages |
Abstract
An odd neighborhood transversal of a graph is a set of its vertices that intersects the set of neighbors of each of its vertices in an odd number of elements. In the case of grid graphs this odd number will be either one or three. We characterize those grid graphs that have odd neighborhood transversals.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Robert Cowen, Stephen H. Hechler, John W. Kennedy, Arthur Steinberg,