Chessboard domination problems
Date
2010-03-31T22:08:44Z
Authors
Cockayne, E. J.
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
A graph may be formed from an n x n chessboard by taking the squares as the vertices and two vertices are adjacent if a chess piece situated on one square covers the other. In this paper we survey some recent results concerning domination parameters for certain graphs constructed in this way from the moves of queens and bishops.
Description
Keywords
technical reports (mathematics and statistics)