cyclomatic number
the minimum number of edges to remove from a graph to eliminate all its cycles
Facts
8 properties- Instance of
- graph property
- Defining formula
- r = m - n + c
- Different from
- nullity, cycle rank[3][4]
- Discoverer or inventor
- Gustav Kirchhoff[2]
- In defining formula
- r, m, n, c
- Less than
- number of edges[8]
- Studied by
- graph theory, category theory[5][6]
🏷️ Also known as
en nullity
en graph Betti number
en graph nullity
en circuit rank
en cycle rank
en cyclomatic number
en feedback edge number
en feedback edge set number
en first Betti number
cs Cyklomatické číslo
de zyklomatische Zahl
hu ciklikus rang
hu ciklomatikus szám
hu nullitás
ja 回路のランク
ja 回路ランク
pl liczba cyklomatryczna
ro rangul unui circuit
ru контурный ранг
ru цикломатическое число
🔖 Identifiers · 4
- Exact match
- www.findstat.org
- Freebase ID
- /m/054_mm
- MathWorld ID
- CircuitRank
- Microsoft Academic ID (discontinued)
- 8287714
🔗 Connections
Studied by 2
Discoverer or inventor 1
Instance of 1
Maintained by WikiProject 1
Press Enter · cited answer in seconds
0 sources
Summary
cyclomatic number is a graph property[1].