GraphTheory[SpecialGraphs]
RooksGraph
construct rook's graph
Calling Sequence
Parameters
Description
Examples
Compatibility
RooksGraph(m,n)
m, n
-
positive integers
The RooksGraph(m,n) command creates the m by n rook's graph on m*n vertices. This is the graph which represents all legal moves of the rook chess piece (also known as the castle) on an m by n chessboard.
When n and m are equal, the rook's graph is strongly regular.
with⁡GraphTheory:
with⁡SpecialGraphs:
R ≔ RooksGraph⁡4,6
R≔Graph 1: an undirected graph with 24 vertices and 96 edge(s)
IsPlanar⁡R
false
ChromaticNumber⁡R
6
DrawGraph⁡R
The GraphTheory[SpecialGraphs][RooksGraph] command was introduced in Maple 2020.
For more information on Maple 2020 changes, see Updates in Maple 2020.
See Also
BishopsGraph
ChromaticNumber
IsPlanar
KingsGraph
KnightsGraph
QueensGraph
SpecialGraphs
Download Help Document
What kind of issue would you like to report? (Optional)