Bishop Independence
Liam H. Harris, Stephanie Perkins, Paul A. Roach, Siân K. Jones
Journal of Advances in Mathematics and Computer Science · pp. 835–843 · Published 5 Sep 2013
10.9734/BJMCS/2013/5760Abstract
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¨obius strip, the torus, the Klein bottle and the surface of a cube.
Cited by 3
Stan Wagon · The College Mathematics Journal · 2014
Liam H. Harris, Stephanie Perkins, Paul A. Roach · Recreational Mathematics Magazine · 2021
· The College Mathematics Journal · 2014
Related research
- Disruption of Cell Wall Fatty Acid Biosynthesis in Mycobacterium tuberculosis Using the Concept of Minimum Robust Domination Energy of Graph — shares topic coverage
- Exponential Objects in Categories of Generalized Uniform Hypergraphs — shares topic coverage
- The Domination Number of Pm x Pn — shares topic coverage
- Topological Indices of Antibiotic Drugs used in Pneumonia Treatment with their QSPR Analysis and M-polynomial — shares topic coverage
- Degree-correlation, Robustness and Vulnerability in Finite Scale-free Networks — shares topic coverage
Article metrics
Real usage data collected on this platform.
0
Page views
0
PDF downloads
0
Outbound clicks
3
Citations
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
No views recorded yet.
Traffic sources
Referring site, by host.
No traffic recorded yet.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.