Graph dominance by rook domains for Znp and Zn3 × Zm2 graphs

 

Guardado en:
Sonraí Bibleagrafaíochta
Údar: Piza-Volio, Eduardo
Formáid: artículo original
Stádas:Versión publicada
Fecha de Publicación:2004
Cur Síos: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 the effectiveness of the algorithm by comparing the results with a previously studied class of graphs, including the so-called “football pool” graphs and others. We give some new upper bounds for graphs of the kind Znp, with p ≥ 4. The codes of some dominating subsets are given in an appendix.
País:Portal de Revistas UCR
Institiúid:Universidad de Costa Rica
Repositorio:Portal de Revistas UCR
Teanga:Español
OAI Identifier:oai:portal.ucr.ac.cr:article/243
Rochtain Ar Líne:https://revistas.ucr.ac.cr/index.php/matematica/article/view/243
Palabra clave:Graph domination
simulated annealing
football pool problem
combinatorics
Dominación de grafos
recocido simulado
problema de las apuestas en fútbol
combinatoria