{
  "aliases": [
    "circuit-rank",
    "frerejacque-number"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn graph theory, a branch of mathematics, the **cyclomatic number**, **circuit rank**, **cycle rank**, **corank** or **nullity** of an undirected graph is the minimum number of edges that must be removed from the graph to break all its [[cycles|0Z05VCBQ7Y]], making it into a [[tree|062D9KXJB1]] or forest.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "circuit-rank",
      "frerejacque-number"
    ],
    "inventory": [
      "RXSYKVTKGP"
    ],
    "kind": "concept",
    "name": "Cyclomatic number",
    "same_as": {
      "wikidata": "Q5121616",
      "wikipedia": "Cyclomatic number"
    },
    "sources": [
      {
        "locator": "Cyclomatic number",
        "mention": "wikipedia://en/1483049",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:1483049@r1323644880"
      }
    ],
    "tag": "2Z631ATJ7D"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/2Z631ATJ7D/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/2Z631ATJ7D.md",
  "msc": null,
  "name": "Cyclomatic number",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/2Z6/2Z631ATJ7D.md",
  "status": null,
  "tag": "2Z631ATJ7D",
  "uri": "m2://2Z631ATJ7D",
  "url": "https://math2.tamnd.com/wiki/cyclomatic-number/",
  "writing": {
    "tag": "2Z631ATJ7D",
    "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
      }
    ]
  }
}