Cyclomatic number¶

The dimension of an undirected graph's cycle space, equal to the minimum number of edges whose removal makes it acyclic and computed as edges minus vertices plus connected components.

Version: v2 · 2026-09-19 · History
Domain-specific #: 4015
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Graph Theory → Mathematics

Core Idea¶

Also called circuit rank or cycle rank, the number counts independent cycles, is additive over components and equals the number of non-tree edges relative to any spanning forest.^[1] A spanning forest contributes one fewer edge than vertices in each component; every remaining edge closes one independent fundamental cycle, yielding e-v+c basis elements. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

The load-bearing residual is not the broad topic of graph theory. It is the domain-specific identity determined by the finite undirected graph, loop and parallel-edge convention, vertex and edge counts, connected components, spanning forest, cycle-space coefficient field, independent-cycle basis, edge-removal interpretation, and formula are explicit. That residual remains recognizable when examples, notation, scale, or implementation change, but it disappears if the carrier is mistyped, the condition that the finite undirected graph, loop and parallel-edge convention, vertex and edge counts, connected components, spanning forest, cycle-space coefficient field, independent-cycle basis, edge-removal interpretation, and formula are explicit fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test. This gives the entry an operational identity rather than merely a historical label.

A useful analysis keeps three layers separate. The constitutive layer says what must be true: the finite undirected graph, loop and parallel-edge convention, vertex and edge counts, connected components, spanning forest, cycle-space coefficient field, independent-cycle basis, edge-removal interpretation, and formula are explicit. The evidential layer asks what observation or proof warrants the claim: type the carrier, state every parameter and convention in the definition, test that the finite undirected graph, loop and parallel-edge convention, vertex and edge counts, connected components, spanning forest, cycle-space coefficient field, independent-cycle basis, edge-removal interpretation, and formula are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases. The use layer asks what reasoning becomes available once the identity is established: recognizing and comparing instances of Cyclomatic number, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions. Conflating the layers is the most common source of scope inflation.

How would you explain it like I'm…

Extra Roads, Extra Loops

Imagine towns connected by roads. First you keep just enough roads so you can still get from any town to any town connected to it, with no loops. Every extra road you add back makes a new loop you could drive around. The cyclomatic number is how many of those extra roads there are.

Counting a Graph's Loops

In math, a graph is a set of dots connected by lines. The cyclomatic number counts how many independent loops the graph has. To find it, first keep only enough lines to connect everything without making any loop; this is called a spanning tree, or a spanning forest if the graph is in separate pieces. Each leftover line closes exactly one new loop. So the cyclomatic number equals the number of lines, minus the number of dots, plus the number of separate pieces.

Graph Circuit Rank

The cyclomatic number of a graph, also called its circuit rank or cycle rank, counts its independent cycles. Take any spanning forest, a subset of edges connecting each component with no cycles; in each component it uses one fewer edge than the number of vertices. Every edge left over closes exactly one fundamental cycle, and these cycles are independent. That gives the formula e − v + c, where e is the number of edges, v the number of vertices, and c the number of connected components. It is also the minimum number of edges you must remove to destroy every cycle, and it adds up across separate components. Conventions about loops and repeated edges should be stated, since they change e.

The cyclomatic number (circuit rank, cycle rank) of a finite undirected graph G is r = e − v + c, where e, v, and c are the numbers of edges, vertices, and connected components. The derivation uses a spanning forest: in each component a spanning tree has one fewer edge than vertices, so the forest has v − c edges, and each of the remaining e − v + c non-tree edges closes a unique fundamental cycle with the forest. These fundamental cycles form a basis of the cycle space, the vector space of edge sets with even degree at every vertex, over GF(2) (or the analogous space over other coefficient fields), so r is its dimension. Equivalently, r is the minimum number of edges whose removal leaves a forest. The number is additive over components and independent of which spanning forest is chosen. Whether self-loops and parallel edges are allowed must be fixed, as each contributes to e and to the cycle count.

Structural Signature¶

Carrier: the typed graph theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets
Inputs or antecedent state: the exact graph theory carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Cyclomatic number
Constitutive operation: A spanning forest contributes one fewer edge than vertices in each component; every remaining edge closes one independent fundamental cycle, yielding e-v+c basis elements.
Invariant: the finite undirected graph, loop and parallel-edge convention, vertex and edge counts, connected components, spanning forest, cycle-space coefficient field, independent-cycle basis, edge-removal interpretation, and formula are explicit
Recognition test: type the carrier, state every parameter and convention in the definition, test that the finite undirected graph, loop and parallel-edge convention, vertex and edge counts, connected components, spanning forest, cycle-space coefficient field, independent-cycle basis, edge-removal interpretation, and formula are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases
Output or consequence: recognizing and comparing instances of Cyclomatic number, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions
Failure boundary: the carrier is mistyped, the condition that the finite undirected graph, loop and parallel-edge convention, vertex and edge counts, connected components, spanning forest, cycle-space coefficient field, independent-cycle basis, edge-removal interpretation, and formula are explicit fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test

What It Is Not¶

It is not the whole field of graph theory. The field contains many questions and methods that do not instantiate Cyclomatic number.
It is not its most familiar example. A canonical instance directly demonstrates that the finite undirected graph, loop and parallel-edge convention, vertex and edge counts, connected components, spanning forest, cycle-space coefficient field, independent-cycle basis, edge-removal interpretation, and formula are explicit. exhibits the structure, but the example is evidence for the abstraction rather than its definition.
It is not the neighboring catalog concept Crossing number (graph theory). Crossing number minimizes drawn edge intersections; cyclomatic number is a purely combinatorial dimension of cycle structure independent of a drawing.
It is not a claim that every boundary case has one uncontested classification. a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Cyclomatic number must control the decision
It is not an unrestricted metaphor for any process that seems similar. Outside graph theory, the vocabulary and validity conditions do not transfer literally.

Scope of Application¶

Cyclomatic number belongs to graph theory and is useful where the analyst can specify the typed graph theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the finite undirected graph, loop and parallel-edge convention, vertex and edge counts, connected components, spanning forest, cycle-space coefficient field, independent-cycle basis, edge-removal interpretation, and formula are explicit. The scope is broad within that domain but bounded by the need for the finite undirected graph, loop and parallel-edge convention, vertex and edge counts, connected components, spanning forest, cycle-space coefficient field, independent-cycle basis, edge-removal interpretation, and formula are explicit. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.^[2]

Definition and recognition. Determine whether a proposed instance satisfies the constitutive conditions rather than merely sharing terminology.
Construction or evolution. Track how the exact graph theory carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Cyclomatic number are converted, constrained, or organized by A spanning forest contributes one fewer edge than vertices in each component; every remaining edge closes one independent fundamental cycle, yielding e-v+c basis elements..
Comparison. Compare instances using carrier, parameters, convention, domain, scale, boundary conditions, evidence, exact versus approximate form, and limiting behavior, without treating convenience measures as the definition.
Boundary analysis. Diagnose cases where a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Cyclomatic number must control the decision and state which convention or theorem controls the decision.
Downstream reasoning. Use the established identity to support recognizing and comparing instances of Cyclomatic number, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions while preserving the assumptions under which the inference is valid.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the finite undirected graph, loop and parallel-edge convention, vertex and edge counts, connected components, spanning forest, cycle-space coefficient field, independent-cycle basis, edge-removal interpretation, and formula are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Cyclomatic number can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated. The disciplined statement is: given the exact graph theory carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Cyclomatic number, the structure counts as Cyclomatic number exactly when the finite undirected graph, loop and parallel-edge convention, vertex and edge counts, connected components, spanning forest, cycle-space coefficient field, independent-cycle basis, edge-removal interpretation, and formula are explicit.

This format also separates identity from measurement. Empirical, computational, or documentary proxies support recognition only under declared validity and uncertainty assumptions; formal cases require proof rather than measurement. Measurements can be noisy, implementations can approximate, and proofs can use equivalent characterizations; none of those facts licenses changing the object being measured. When reports disagree, first check scope and convention, then data or proof, and only then interpret the disagreement as substantive.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Cyclomatic number. Cyclomatic number compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

The compression has a price. A single label can hide canonical, generalized, restricted, approximate, computational, empirical, and historically variant formulations of Cyclomatic number. Good use therefore carries a small declaration of assumptions alongside the name. The abstraction manages complexity when it reduces the state space of the question while keeping the failure boundary visible; it mismanages complexity when the label substitutes for that boundary analysis.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed graph theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express the finite undirected graph, loop and parallel-edge convention, vertex and edge counts, connected components, spanning forest, cycle-space coefficient field, independent-cycle basis, edge-removal interpretation, and formula are explicit independently of one notation or implementation. This step prevents the canonical example from becoming the definition.
Derive consequences. From the finite undirected graph, loop and parallel-edge convention, vertex and edge counts, connected components, spanning forest, cycle-space coefficient field, independent-cycle basis, edge-removal interpretation, and formula are explicit, infer recognizing and comparing instances of Cyclomatic number, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions. Record each assumption used so that a later change of setting does not silently preserve an invalid conclusion.
Test adversarial cases. Examine a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Cyclomatic number must control the decision and an object that resembles Cyclomatic number in purpose or vocabulary but does not satisfy its invariant is outside the class. A robust identity explains why the first is convention-sensitive and why the second is outside the class.
Compare and refine. Use carrier, parameters, convention, domain, scale, boundary conditions, evidence, exact versus approximate form, and limiting behavior to compare legitimate instances, and refine the model when discrepancies reflect hidden variation rather than failure of the abstraction itself.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of graph theory because they reuse the typed graph theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, A spanning forest contributes one fewer edge than vertices in each component; every remaining edge closes one independent fundamental cycle, yielding e-v+c basis elements., and type the carrier, state every parameter and convention in the definition, test that the finite undirected graph, loop and parallel-edge convention, vertex and edge counts, connected components, spanning forest, cycle-space coefficient field, independent-cycle basis, edge-removal interpretation, and formula are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases. A theorem, diagnostic, or modeling warning can travel when those roles remain literal. For example, the distinction between constitutive identity and a convenient observable transfers from A canonical instance directly demonstrates that the finite undirected graph, loop and parallel-edge convention, vertex and edge counts, connected components, spanning forest, cycle-space coefficient field, independent-cycle basis, edge-removal interpretation, and formula are explicit. to An applied instance preserves the same invariant under a changed scale, notation, jurisdiction, dataset, or implementation..^[3]

Transfer outside the home domain is weaker. The skeletal pattern—type the carrier, apply the defining mechanism of Cyclomatic number, preserve its invariant, and derive only consequences licensed by the stated boundary—may suggest an analogy, but the domain-specific mechanisms, admissible evidence, and consequences do not come along automatically. The safe transfer procedure maps each role explicitly, checks the invariant again, and refuses the name when only a superficial resemblance remains.

Examples¶

Canonical¶

A canonical instance directly demonstrates that the finite undirected graph, loop and parallel-edge convention, vertex and edge counts, connected components, spanning forest, cycle-space coefficient field, independent-cycle basis, edge-removal interpretation, and formula are explicit. The example exposes the carrier and directly tests that the finite undirected graph, loop and parallel-edge convention, vertex and edge counts, connected components, spanning forest, cycle-space coefficient field, independent-cycle basis, edge-removal interpretation, and formula are explicit; changing incidental notation preserves the identity, while removing that condition destroys it. This example is canonical because every role can be inspected: the carrier is the typed graph theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets; the operative rule is A spanning forest contributes one fewer edge than vertices in each component; every remaining edge closes one independent fundamental cycle, yielding e-v+c basis elements.; the invariant is the finite undirected graph, loop and parallel-edge convention, vertex and edge counts, connected components, spanning forest, cycle-space coefficient field, independent-cycle basis, edge-removal interpretation, and formula are explicit; and the result supports recognizing and comparing instances of Cyclomatic number, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions.^[1] Changing incidental notation or scale leaves the structure intact, while removing the finite undirected graph, loop and parallel-edge convention, vertex and edge counts, connected components, spanning forest, cycle-space coefficient field, independent-cycle basis, edge-removal interpretation, and formula are explicit destroys the classification.

Mapped back: the typed graph theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets → A spanning forest contributes one fewer edge than vertices in each component; every remaining edge closes one independent fundamental cycle, yielding e-v+c basis elements. → the finite undirected graph, loop and parallel-edge convention, vertex and edge counts, connected components, spanning forest, cycle-space coefficient field, independent-cycle basis, edge-removal interpretation, and formula are explicit → recognizing and comparing instances of Cyclomatic number, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions

Applied / In Practice¶

An applied instance preserves the same invariant under a changed scale, notation, jurisdiction, dataset, or implementation. The applied case qualifies only because the same invariant and boundary test remain literal under changed parameters or implementation. The applied case is not licensed merely by vocabulary. It qualifies because the same recognition test—type the carrier, state every parameter and convention in the definition, test that the finite undirected graph, loop and parallel-edge convention, vertex and edge counts, connected components, spanning forest, cycle-space coefficient field, independent-cycle basis, edge-removal interpretation, and formula are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases—can be run and because the same failure boundary—the carrier is mistyped, the condition that the finite undirected graph, loop and parallel-edge convention, vertex and edge counts, connected components, spanning forest, cycle-space coefficient field, independent-cycle basis, edge-removal interpretation, and formula are explicit fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test—remains meaningful.^[2] The case also shows why practical outputs should report assumptions, resolution, and uncertainty instead of a naked label.

Mapped back: declared instance → recognition test → boundary check → qualified use

Structural Tensions¶

T1: Axiomatic identity vs. operational recognition. The defining conditions may be exact while empirical or computational recognition is approximate. Neither pole can be removed without changing the analytical task. Diagnostic: Can the reviewer state both the exact condition and the evidence used to infer it?
T2: Local roles vs. global consequence. The mechanism is enacted through local relations, but the abstraction is usually valued for a global classification or prediction. Neither pole can be removed without changing the analytical task. Diagnostic: Does the claimed global result actually follow from the declared local conditions?
T3: Ideal form vs. finite representation. Theory states a clean invariant while data structures, measurements, or proofs expose only finite representations. Neither pole can be removed without changing the analytical task. Diagnostic: Would increasing resolution converge toward the same classification?
T4: Canonical convention vs. legitimate variants. A standard formulation supports communication, while variants may preserve the same core under changed assumptions. Neither pole can be removed without changing the analytical task. Diagnostic: Which role is invariant across variants, and which convention-specific conclusion changes?
T5: Compression vs. hidden assumptions. The name compresses a complex argument but can conceal prerequisites. Neither pole can be removed without changing the analytical task. Diagnostic: Can each downstream inference be traced to an explicit assumption?
T6: Autonomous residual vs. reduction to catalog neighbors. The candidate uses broader structures but adds an identity-bearing residual. Neither pole can be removed without changing the analytical task. Diagnostic: After subtracting the proposed parent and named neighbors, does the constitutive residual still support independent diagnostics?

Structural–Framed Character¶

The entry is structurally mixed but domain-framed. Its portable skeleton is type the carrier, apply the defining mechanism of Cyclomatic number, preserve its invariant, and derive only consequences licensed by the stated boundary. Its identity-bearing terms—Cyclomatic number, carrier, parameter, invariant, boundary, evidence, model, transformation, and application—derive their meaning from graph theory and cannot be replaced by generic systems language without losing the tests that distinguish valid from invalid instances.

This mixed character explains why the abstraction is reusable inside the domain yet does not meet the Prime bar. The structure organizes reasoning, but its claims still depend on domain-specific objects, evidence, and intervention semantics.

Structural Core vs. Domain Accent¶

The structural core consists of a carrier, A spanning forest contributes one fewer edge than vertices in each component; every remaining edge closes one independent fundamental cycle, yielding e-v+c basis elements., a recognition invariant, and a consequence. That skeleton may resemble patterns elsewhere, especially type the carrier, apply the defining mechanism of Cyclomatic number, preserve its invariant, and derive only consequences licensed by the stated boundary. The domain accent is not decorative: Cyclomatic number, carrier, parameter, invariant, boundary, evidence, model, transformation, and application determine what counts as an admissible carrier, a valid transition, and successful evidence.

The abstraction therefore remains domain-specific. A cross-domain reuse that preserves only words such as 'balance,' 'cut,' 'sequence,' 'loss,' or 'simulation' is metaphor. Literal transfer requires the original role structure and diagnostics, which in this case remain anchored in graph theory.

This entry is a kind of Dimension.

It remains its own entry because its identity is fixed by the finite undirected graph, loop and parallel-edge convention, vertex and edge counts, connected components, spanning forest, cycle-space coefficient field, independent-cycle basis, edge-removal interpretation, and formula.

Relationships to Other Abstractions¶

Current abstraction Cyclomatic number Domain-specific

Parents (1) — outgoing typed relations

Cyclomatic number is a kind of Dimension Prime

It remains its own entry because its identity is fixed by the finite undirected graph, loop and parallel-edge convention, vertex and edge counts, connected components, spanning forest, cycle-space coefficient field, independent-cycle basis, edge-removal interpretation, and formula.

Hierarchy path (1) — routes to 1 parentless root

Cyclomatic number → is a kind of Dimension

Neighborhood in Abstraction Space¶

Cyclomatic number sits in a crowded region of the domain-specific corpus (3^rd percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Graph Theory Structures & Invariants (48 abstractions)

Nearest neighbors

Pancyclic graph — 0.94
Starlike tree — 0.93
Split graph — 0.93
Treewidth — 0.93
Crossing number (graph theory) — 0.93

Computed from structural-signature embeddings · 2026-10-25

Not to Be Confused With¶

Crossing number (graph theory). Crossing number minimizes drawn edge intersections; cyclomatic number is a purely combinatorial dimension of cycle structure independent of a drawing.
One canonical example. An instance demonstrates the structure but does not define the whole abstraction.
Measurement or implementation of Cyclomatic number. A proxy or realization is evidence for the abstraction, not the abstraction itself.
Generalized Cyclomatic number. An extension qualifies only when its changed axioms and retained invariant are stated.

References¶

[1] Peter Robert Kotiuga, 'A Celebration of the Mathematical Legacy of Raoul Bott', American Mathematical Soc, 2010.not authoritative registry ↩a ↩b

[2] Per Hage, 'Island Networks: Communication, Kinship, and Classification Structures in Oceania', Cambridge University Press, 1996. registry ↩a ↩b

[3] Claude Berge, 'The Theory of Graphs', Courier Dover Publications, 2001.not authoritative registry ↩