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.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.
References in periodicals archive ?
In a graph G, the number of independent cycles is called its cyclomatic number and is equal to [gamma] = m - n + 1.
McCabe defined the cyclomatic number as program complexity [3].
Cyclomatic number can be easily computed in the development lifecycle during all phases.
The cyclomatic number of the resulting model, which determines the number of cycles at flowchart with a common edge labeled b, corresponding dissipative coupling
(iv) Cyclomatic number [23]: often related to complexity measures and thus usually referred to as cyclomatic complexity number, but there is not a full agreement about the subject [22].
Corollary 3.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 cyclomatic number of a graph G is [absolute value of [E.sub.G]] - [absolute value of [V.sub.G]] + [c.sub.G], where [c.sub.G] is the number of connected components of G.
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.
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).
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).