---
tag: 40R5MAE4YJ
kind: concept
name: Bishop's graph
sources:
  - wikipedia: en:72198733@r1285181617
    locator: Bishop's graph
    note: adopted
    mention: wikipedia://en/72198733
    sections: [Summary]
same_as:
  wikidata: Q29554807
  wikipedia: Bishop's graph
inventory: [1E4QS23854]
---

## Summary

In mathematics, a **bishop's graph** is a [[graph|00C0BR7D7H]] that represents all legal moves of the chess piece the bishop on a chessboard. Each vertex represents a square on the chessboard and each edge represents a legal move of the bishop; that is, there is an edge between two vertices (squares) if they occupy a common diagonal. When the chessboard has dimensions $m\times n$, then the induced graph is called the $m\times n$ bishop's graph.