olemus
Wiktionary:
adj
1. (graph theory) used to describe the number of edges that must be removed from a graph to ensure that no graph cycle remains; equal to the number of edges, minus the number of nodes plus one
2. (network analysis) used to describe the number of circuits in a network; equal to the number of edges, minus the number of nodes plus the number of graphs
3. (software engineering) of or relating to a software metric that measures the complexity of a program based on the number of linearly independent paths through the source code