Lesson plan
Cycle space
In graph theory, a branch of mathematics, the (binary) cycle space of an undirected graph is the set of its even-degree spanning subgraphs, or the set of their edge sets. This set of subgraphs can be described algebraically as a vector space over \Z_2 (the field with two elements). The dimension of this space is the circuit rank, or cyclomatic number, of the graph. The same space can also be described in terms from algebraic topology as the first homology group of the graph. Using homology theory, the binary cycle space may be generalized to cycle spaces over arbitrary rings.
Article summary
In graph theory, a branch of mathematics, the (binary) cycle space of an undirected graph is the set of its even-degree spanning subgraphs, or the set of their edge sets. This set of subgraphs can be described algebraically as a vector space over \Z_2 (the field with two elements). The dimension of this space is the circuit rank, or cyclomatic number, of the graph. The same space can also be described in terms from algebraic topology as the first homology group of the graph. Using homology theory, the binary cycle space may be generalized to cycle spaces over arbitrary rings.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.