The

cyclomatic number of the resulting model, which determines the number of cycles at flowchart with a common edge labeled b, corresponding dissipative coupling

We recall that the cyclomatic number of a graph G is the minimal number of edges we have to remove from G to obtain a graph without cycle (see e.

8 Let P be a connected poset, the degree of Num(*P) is equal to the cyclomatic number of the Hasse diagram of P.

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:

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

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.

According to graph theory, the maximal size of a set of independent paths is unique for any given graph and is called the cyclomatic number, and can be easily calculated by the following formula.

where v(G) denotes the cyclomatic number of the graph G, n is the number of vertices in G, e is the number of edges, and p is the number of strongly connected components.

Graph theory [1] defines the

cyclomatic number of a graph with n nodes, e edges, and p strongly connected components as e - 1 + p, which represents the number of fundamental cycles of the graph.

In the present paper we study graphs G in which the maximum number of vertex-disjoint cycles v(G) is close to the cyclomatic number [mu](G), which is a natural upper bound for v(G).

Recht, On a relation between the cycle packing number and the cyclomatic number of a graph, manuscript (2008).

This apparent ambiguity arises as a result of a basic error in the use of the

cyclomatic number (from graph theory) in the calculation of cyclomatic complexity (in software).