A white bishop graph is a graph formed from possible moves of a bishop chess piece, which may make diagonal moves of any length on a chessboard (or any other board), when starting from a white square on the board. To form the graph, each chessboard square is considered a vertex, and vertices connected by allowable bishop moves are considered edges.
The 
-white
bishop graph is therefore a connected component
of the general 
-bishop graph. It is isomorphic to the 
-black bishop graph
unless both 
and 
are odd.
Special cases are summarized in the following table.
 | graph |
 | empty
graph  |
 | path graph  |
 | square
graph  |
 |  -triangular honeycomb bishop graph |
