<abstract xmlns="http://www.w3.org/1999/xhtml">

<p>We define the <italic>queens (resp., rooks) diameter-separation number</italic> to be the minimum number of pawns for which some placement of those pawns on an <italic>n</italic> × <italic>n</italic> board produces a board with a queens graph (resp., rooks graph) with a desired diameter <italic>d</italic>. We determine these numbers for some small values of <italic>d</italic>.</p>
</abstract>

We define the queens (resp., rooks) diameter-separation number to be the minimum number of pawns for which some placement of those pawns on an n × n board produces a board with a queens graph (resp., rooks graph) with a desired diameter d. We determine these numbers for some small values of d.

Diameter-Separation of Chessboard Graphs

Recreational Mathematics Magazine

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

{"article-title":"Diameter-Separation of Chessboard Graphs"}

We define the queens (resp., rooks) diameter-separation number to be the minimum number of pawns for which some placement of those pawns on an n × n board...

Diameter-Separation of Chessboard Graphs

Data publikacji: 07 gru 2021

Zakres stron: 13 - 26

DOI: https://doi.org/10.2478/rmm-2021-0008

© 2021 Doug Chatham, published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.