Circuit rank
id:
circuit-rank-164-12910967
title:
Circuit rank
text:
In graph theory, a branch of mathematics, the circuit rank, cyclomatic number, cycle rank, or nullity of an undirected graph is the minimum number of edges that must be removed from the graph to break all its cycles, making it into a tree or forest. It is equal to the number of independent cycles in the graph. Unlike the corresponding feedback arc set problem for directed graphs, the circuit rank r is easily computed using the formula
- r = m − n + c, where m is the number of edges in the give
brand slug:
wiki
category slug:
encyclopedia
description:
Fewest graph edges whose removal breaks all cycles
original url:
https://en.wikipedia.org/wiki/Circuit_rank
date created:
2005-02-08T22:54:32Z
date modified:
2024-08-29T00:29:34Z
main entity:
{"identifier":"Q5121616","url":"https://www.wikidata.org/entity/Q5121616"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/5/5b/6n-graf.svg","width":333,"height":220}
fields total:
13
integrity:
16