๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Chessboard domination problems

โœ Scribed by E.J. Cockayne

Book ID
103056206
Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
465 KB
Volume
86
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis

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.

๐Ÿ“œ SIMILAR VOLUMES

Chessboard graphs, related designs, and
Chessboard graphs, related designs, and domination parameters
โœ Renu Laskar; Charles Wallis ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 162 KB

The graph-theoretic study of combinatorial chessboard problems can be extended to the study of line graphs of graphs of combinatorial designs. In particular, the determination of optimal placements of rooks on a chessboard corresponds to the determination of domination parameters of graphs of block