# Tony Yu Chang

- Citations Per Year

- Citations Per Year

Learn More

The k n grid graph is the product P k P n of a path of length k ?1 and a path of length n ?1. We prove here formulas found by E. O. Hare for the domination numbers of P 5 P n and P 6 P n .

- ‹
- 1
- ›