---
tag: 2Z631ATJ7D
kind: concept
name: Cyclomatic number
aliases: [circuit-rank, frerejacque-number]
sources:
  - wikipedia: en:1483049@r1323644880
    locator: Cyclomatic number
    note: adopted
    mention: wikipedia://en/1483049
    sections: [Summary]
same_as:
  wikidata: Q5121616
  wikipedia: Cyclomatic number
inventory: [RXSYKVTKGP]
---

## Summary

In 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.