Chessboard domination problems

Simple item page
dc.contributor.authorCockayne, E. J.
dc.date.accessioned2010-03-31T22:08:44Z
dc.date.available2010-03-31T22:08:44Z
dc.date.copyright1986en
dc.date.issued2010-03-31T22:08:44Z
dc.description.abstractA 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.en
dc.identifier.urihttp://hdl.handle.net/1828/2415
dc.language.isoenen
dc.relation.ispartofseriesDM-408-IRen
dc.subjecttechnical reports (mathematics and statistics)
dc.subject.departmentDepartment of Mathematics and Statistics
dc.titleChessboard domination problemsen
dc.title.alternativeChessboard domination problems involving queens and bishopsen
dc.typeTechnical Reporten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
DM-408-IR.pdf
Size:
1.23 MB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.84 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Faculty and Staff Publications
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.