Properties of dominating sets of the queens graph Q4k+3

Authors

  • Burger A.P.
  • Mynhardt C.M.

Abstract

he domination number γ(Qn) of the queens graph Qn is the minimum number of queens required to cover every square on an n×n chessboard. We discuss properties of dominating sets of Q4k+3 of cardinality 2k+1 and show that such sets do not exist for 3 ≤ k ≤ 7. This result yields the new domination numbers γ(Q19) = 10 and γ (Q31) = 16.

Published

2000-05-09

How to Cite

Burger A.P., & Mynhardt C.M. (2000). Properties of dominating sets of the queens graph Q4k+3. Utilitas Mathematica, 57. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/192

Issue

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.