Bishop independence

Liam Harris; Stephanie Perkins; Paul Roach; Sian-Kathryn Jones

doi:10.9734/BJMCS/2013/5760

Bishop independence

Liam Harris, Stephanie Perkins, Paul Roach, Sian-Kathryn Jones

Cyfadran Cyfrifiadureg, Peirianneg a Gwyddoniaeth

Allbwn ymchwil: Cyfraniad at gyfnodolyn › Erthygl › adolygiad gan gymheiriaid

83 Wedi eu Llwytho i Lawr (Pure)

Crynodeb

Bishop Independence concerns determining the maximum number of Bishops that can be placed on a board such that no Bishop can attack any other Bishop. This paper presents the solution to the Bishop Independence problem, determining the Bishop Independence number, for all sizes of boards on the following topologies: the cylinder, the Möbius strip, the torus, the Klein bottle and the surface of a cube.

Iaith wreiddiol	Saesneg
Tudalennau (o-i)	835 - 843
Nifer y tudalennau	8
Cyfnodolyn	British journal of mathematics and computer science
Cyfrol	3
Rhif cyhoeddi	4
Dynodwyr Gwrthrych Digidol (DOIs)	https://doi.org/10.9734/BJMCS/2013/5760
Statws	E-gyhoeddi cyn argraffu - 5 Medi 2013

Mynediad at Ddogfen

10.9734/BJMCS/2013/5760Trwydded: CC BY

HarrisPerkinsRoachJones Bishop 2013Fersiwn derfynol wedi’i chyhoeddi, 705 KBTrwydded: CC BY

Dyfynnu hyn

@article{4ae32797725e4a858c72f5eea0e9d5f0,

title = "Bishop independence",

abstract = "Bishop Independence concerns determining the maximum number of Bishops that can be placed on a board such that no Bishop can attack any other Bishop. This paper presents the solution to the Bishop Independence problem, determining the Bishop Independence number, for all sizes of boards on the following topologies: the cylinder, the M{\"o}bius strip, the torus, the Klein bottle and the surface of a cube.",

keywords = "graph, bishop graph, independence, bishop independence, chess, chessboards",

author = "Liam Harris and Stephanie Perkins and Paul Roach and Sian-Kathryn Jones",

year = "2013",

month = sep,

day = "5",

doi = "10.9734/BJMCS/2013/5760",

language = "English",

volume = "3",

pages = "835 -- 843",

journal = "British journal of mathematics and computer science",

issn = "2231-0851",

publisher = "SCIENCEDOMAIN International",

number = "4",

}

TY - JOUR

T1 - Bishop independence

AU - Harris, Liam

AU - Perkins, Stephanie

AU - Roach, Paul

AU - Jones, Sian-Kathryn

PY - 2013/9/5

Y1 - 2013/9/5

N2 - Bishop Independence concerns determining the maximum number of Bishops that can be placed on a board such that no Bishop can attack any other Bishop. This paper presents the solution to the Bishop Independence problem, determining the Bishop Independence number, for all sizes of boards on the following topologies: the cylinder, the Möbius strip, the torus, the Klein bottle and the surface of a cube.

AB - Bishop Independence concerns determining the maximum number of Bishops that can be placed on a board such that no Bishop can attack any other Bishop. This paper presents the solution to the Bishop Independence problem, determining the Bishop Independence number, for all sizes of boards on the following topologies: the cylinder, the Möbius strip, the torus, the Klein bottle and the surface of a cube.

KW - graph

KW - bishop graph

KW - independence

KW - bishop independence

KW - chess

KW - chessboards

U2 - 10.9734/BJMCS/2013/5760

DO - 10.9734/BJMCS/2013/5760

M3 - Article

VL - 3

SP - 835

EP - 843

JO - British journal of mathematics and computer science

JF - British journal of mathematics and computer science

SN - 2231-0851

IS - 4

ER -

Bishop independence

Crynodeb

Mynediad at Ddogfen

Ôl bys

Dyfynnu hyn