{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Statement\n\nKirchhoff's theorem holds for [[multigraphs|0C62PZXX02]] as well; the matrix *L* is modified as follows:\n\n- The entry *q\u003csub\u003ei,j\u003c/sub\u003e* equals −*m*, where *m* is the number of edges between *i* and *j*;\n- when counting the degree of a vertex, all loops are excluded.\n\nCayley's formula for a complete multigraph is *m*\u003csup\u003e*n*−1\u003c/sup\u003e(*n*\u003csup\u003e*n*−1\u003c/sup\u003e−(*n*−1)*n*\u003csup\u003e*n*−2\u003c/sup\u003e) by same methods produced above, since a simple graph is a multigraph with *m* = 1.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "T7ZSPAQCV3"
    ],
    "kind": "statement",
    "name": "Kirchhoff's theorem for multigraphs",
    "role": "theorem",
    "sources": [
      {
        "locator": "Kirchhoff's theorem, section Particular cases and generalizations \u003e Kirchhoff's theorem for multigraphs",
        "mention": "wikipedia://en/1270691#D0O8",
        "note": "adopted",
        "sections": [
          "Statement"
        ],
        "wikipedia": "en:1270691@r1374532193"
      }
    ],
    "tag": "BDZGK4PHPR"
  },
  "kind": "statement",
  "link": "https://math2.tamnd.com/node/BDZGK4PHPR/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/BDZGK4PHPR.md",
  "msc": null,
  "name": "Kirchhoff's theorem for multigraphs",
  "prov": null,
  "role": "theorem",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/BDZ/BDZGK4PHPR.md",
  "status": null,
  "tag": "BDZGK4PHPR",
  "uri": "m2://BDZGK4PHPR",
  "url": "https://math2.tamnd.com/wiki/kirchhoffs-theorem-for-multigraphs/",
  "writing": {
    "tag": "BDZGK4PHPR",
    "kind": "statement",
    "level": "W0",
    "next": [
      {
        "what": "edge uses out",
        "note": "each definition that the statement needs",
        "have": 0,
        "want": 1
      }
    ]
  }
}