{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "0T0F6CCS9W"
    },
    {
      "field": "uses",
      "target": "1X0E3JHCH9"
    },
    {
      "field": "uses",
      "target": "4135XQ4WHK"
    },
    {
      "field": "uses",
      "target": "4XQ8TYS2C4"
    }
  ],
  "body": "\n## Summary\n\nThe degree of a vertex is the number of edges that meet it. Degrees are the simplest numerical invariants of a graph. The node [[degree of a vertex|0T0F6CCS9W]] gives the precise definition.\n",
  "commit": "ff8a40749dc16545e3d2fc637f6b0196e81d0bfa",
  "front": {
    "kind": "concept",
    "msc": [
      "05C07"
    ],
    "name": "Degree of a vertex",
    "same_as": {
      "wikidata": "Q383444",
      "wikipedia": "Degree (graph theory)"
    },
    "sources": [
      {
        "locator": "lead section",
        "url": "https://en.wikipedia.org/wiki/Degree_(graph_theory)"
      }
    ],
    "tag": "0KS0KRDV4Y"
  },
  "kind": "concept",
  "link": "https://tamnd.github.io/math2/node/0KS0KRDV4Y/",
  "links": null,
  "markdown": "https://tamnd.github.io/math2/node/0KS0KRDV4Y.md",
  "msc": [
    "05C07"
  ],
  "name": "Degree of a vertex",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0KS/0KS0KRDV4Y.md",
  "status": null,
  "tag": "0KS0KRDV4Y",
  "uri": "m2://0KS0KRDV4Y",
  "url": "https://tamnd.github.io/math2/wiki/degree-of-a-vertex/",
  "writing": {
    "tag": "0KS0KRDV4Y",
    "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
      }
    ]
  }
}