Queen's domination using border squares and \((A,B)\)-restricted domination

DOI10.1016/j.disc.2007.08.065zbMath1159.05042OpenAlexW2155557225MaRDI QIDQ942117

Anne Sinko, Peter J. Slater

Publication date: 4 September 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.08.065

zbMATH Keywords

dominationdomination chainQueen's chessboard graphrestricted domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Domination in Chessboards ⋮ My Top 10 Graph Theory Conjectures and Open Problems

Cites Work

• On the diagonal queens domination problem
• An upper bound for the minimum number of queens covering the \(n {\times} n\) chessboard
• Efficient domination in knights graphs
• Perfect codes in graphs
• Properties of Hereditary Hypergraphs and Middle Graphs
• Values of domination numbers of the queen's graph
• Upper bounds for domination numbers of the queen's graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Queen's domination using border squares and \((A,B)\)-restricted domination