{
  "aliases": [
    "rook-graph"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn graph theory, a **rook's graph** is an undirected graph that represents all legal moves of the rook chess piece on a chessboard. Each vertex of a rook's graph represents a square on a chessboard, and there is an edge between any two squares sharing a row (rank) or column (file), the squares that a rook can move between. These graphs can be constructed for chessboards of any rectangular shape. Although rook's graphs have only minor significance in chess lore, they are more important in the abstract mathematics of graphs through their alternative constructions: rook's graphs are the Cartesian product of two [[complete graphs|03WKB2H474]], and are the line graphs of [[complete bipartite graphs|0V0GC7BQAN]]. The square rook's graphs constitute the two-dimensional Hamming graphs.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "rook-graph"
    ],
    "inventory": [
      "567N6QXJMM"
    ],
    "kind": "concept",
    "name": "Rook's graph",
    "same_as": {
      "wikidata": "Q7366184",
      "wikipedia": "Rook's graph"
    },
    "sources": [
      {
        "locator": "Rook's graph",
        "mention": "wikipedia://en/7324959",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:7324959@r1356336964"
      }
    ],
    "tag": "RZTXV8FF4A"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/RZTXV8FF4A/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/RZTXV8FF4A.md",
  "msc": null,
  "name": "Rook's graph",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/RZT/RZTXV8FF4A.md",
  "status": null,
  "tag": "RZTXV8FF4A",
  "uri": "m2://RZTXV8FF4A",
  "url": "https://math2.tamnd.com/wiki/rooks-graph/",
  "writing": {
    "tag": "RZTXV8FF4A",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge defines in",
        "note": "at least one definition",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 0,
        "want": 2
      },
      {
        "what": "edge not_instance_of in",
        "note": "at least one non-example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}