Domination and irredundance in the queens' graph

DOI10.1016/0012-365X(95)00327-SzbMath0873.05055OpenAlexW2071807082MaRDI QIDQ1356524

E. J. Cockayne, Alewyn P. Burger, Christina M. Mynhardt

Publication date: 26 October 1997

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

Full work available at URL: https://doi.org/10.1016/0012-365x(95)00327-s

zbMATH Keywords

domination numberdominating setschessboardirredundant setqueens' graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (6)

An upper bound for the minimum number of queens covering the \(n {\times} n\) chessboard ⋮ Domination and irredundance in the queens' graph ⋮ Queen domination of even square boards ⋮ Irredundance ⋮ Domination in Chessboards ⋮ An improved upper bound for queens domination numbers

Cites Work

• Bibliography on domination in graphs and some basic definitions of domination parameters
• Domination and irredundance in the queens' graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Domination and irredundance in the queens' graph