cyclomatic number

cyclomatic number

[¦sī·klə‚mad·ik ′nəm·bər]
(mathematics)
For a graph, the number e-n + 1, where e is the number of edges and n is the number of nodes.
References in periodicals archive ?
More exactly, we write, for any graph G with at least one cycle, [phi](G) as a linear combination of [phi](G'), where G' runs over graphs with a strictly lower cyclomatic number.
The following properties of N(G) have been proved in (2): the value of N on forests is essential in the next section because we will compute N by induction on the cyclomatic number
In accordance with graph theory, number of independent rings M in a network is equals to the cyclomatic number of network graph, given by Euler's relationship: