rook's graph
graph that represents all legal moves of the rook chess piece on a chessboard
Facts
5 properties- Instance of
- mathematical chess problem
- Subclass of
- regular graph, vertex-transitive graph, gridline graph, well-covered graph, integral graph, Hamming graph[3][4][5][6][7][8]
- Different from
- lattice graph, king's graph, knight's graph, bishop's graph, queen's graph[9][10][11][12][13]
- Studied by
- graph theory[14]
🏷️ Also known as
en rook graph
en rook's graph
de Turm-Graph
fr graphe de la tour
hu bástyagráf
ja ルークのグラフ
pt grafo da torre
ro graf tură
ro graful turei
ru ладейный граф
uk туровий граф
🔖 Identifiers · 4
- Freebase ID
- /m/025z6s6
- MathWorld ID
- RookGraph
- Microsoft Academic ID (discontinued)
- 192472646
- Wolfram Language entity code
- Entity["GraphClass", "Rook"]
🔗 Connections
Different from 3
Subclass of 3
← Different from 3
Instance of 1
Maintained by WikiProject 1
Named after 1
Studied by 1
Subtypes 1
Press Enter · cited answer in seconds
0 sources
Summary
rook's graph is a mathematical chess problem[1].