An m by n rook graph is formed by associating a node with each square of an m by n chess board and connecting two nodes with an edge if a rook can legally move from one to the other. That is, two nodes are connected if they are either in the same row or … Continue reading Rook graphs and Paley graphs
Copy and paste this URL into your WordPress site to embed
Copy and paste this code into your site to embed