 The independence number and domination number of a rook's graph both equal the smaller of its two dimensions, and these are well-covered graphs meaning that every independent set can be extended to a maximum independent set.An rook's graph represents the moves of a rook on an chessboard.Its vertices may be given coordinates , where and .