 The same graphs can be defined mathematically as the Cartesian products of two complete graphs or as the line graphs of complete bipartite graphs.Rook's graphs are highly symmetric.For square chessboards they are distance-transitive graphs and distance-regular graphs, while for rectangular chessboards with relatively prime dimensions they are circulant graphs.