{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "0NZ8MDBN6Q"
    },
    {
      "field": "uses",
      "target": "4Y4MR8W9AF"
    }
  ],
  "body": "\n## Summary\n\nThe adjacency matrix of a finite graph records adjacency as a matrix of zeros and ones. It lets linear algebra study graphs, for example through eigenvalues and powers that count walks. The node [[adjacency matrix|0NZ8MDBN6Q]] gives the precise definition.\n",
  "commit": "ff8a40749dc16545e3d2fc637f6b0196e81d0bfa",
  "front": {
    "kind": "concept",
    "msc": [
      "05C50"
    ],
    "name": "Adjacency matrix",
    "same_as": {
      "wikidata": "Q727035",
      "wikipedia": "Adjacency matrix"
    },
    "sources": [
      {
        "locator": "Definition",
        "url": "https://en.wikipedia.org/wiki/Adjacency_matrix"
      }
    ],
    "tag": "08B9CX109G"
  },
  "kind": "concept",
  "link": "https://tamnd.github.io/math2/node/08B9CX109G/",
  "links": null,
  "markdown": "https://tamnd.github.io/math2/node/08B9CX109G.md",
  "msc": [
    "05C50"
  ],
  "name": "Adjacency matrix",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/08B/08B9CX109G.md",
  "status": null,
  "tag": "08B9CX109G",
  "uri": "m2://08B9CX109G",
  "url": "https://tamnd.github.io/math2/wiki/adjacency-matrix/",
  "writing": {
    "tag": "08B9CX109G",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "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
      }
    ]
  }
}