Graph dominance by rook domains for Znp and Zn3 × Zm2 graphs
Described within is the problem of finding near-minimum dominating subsets of a given graph by rook domains. Specifically, we study the graphs of the kind Znp and Zn3 ×Zm2 and introduce a simulated annealing algorithm to compute upper bounds of the size of minimum dominating subsets. We demonstrate...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universidad de Costa Rica
2009-02-01
|
| Series: | Revista de Matemática: Teoría y Aplicaciones |
| Online Access: | https://revistas.ucr.ac.cr/index.php/matematica/article/view/243 |