Homology Group/Examples/Finite Graph
Jump to navigation
Jump to search
Example of Homology Group
Let $\Gamma$ denote a finite graph.
The number of independent generators for the group $\map {H_1} \Gamma$ equals the number of independent cycles in $\Gamma$.
 | This article, or a section of it, needs explaining. In particular: what all this means, in particular $\map {H_1} \Gamma$ You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by explaining it. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{Explain}} from the code. |
Sources
- 1998: David Nelson: The Penguin Dictionary of Mathematics (2nd ed.) ... (previous) ... (next): homology group
- 2008: David Nelson: The Penguin Dictionary of Mathematics (4th ed.) ... (previous) ... (next): homology group