![]() | This article is rated B-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
|
This can't be quite right, since in a finite graph any set of edges would qualify. AxelBoldt 21:11, 24 Feb 2004 (UTC)
Article currently states:
I don't really understand what this is saying. Clearly, adding just one edge to a spanning tree makes a cycle, and also its clear that one gets one unique cycle for every edge that is not in the spanning tree. Is this the definition of a "fundamental cycle"? linas ( talk) 23:12, 7 September 2008 (UTC)
Shouldnt the article mention that if the graph is considered as a topological space the cycle space is natually identified with the first homology group? 81.101.138.148 ( talk) 10:02, 14 October 2011 (UTC) That was me Billlion ( talk) 10:03, 14 October 2011 (UTC)
![]() | This article is rated B-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
|
This can't be quite right, since in a finite graph any set of edges would qualify. AxelBoldt 21:11, 24 Feb 2004 (UTC)
Article currently states:
I don't really understand what this is saying. Clearly, adding just one edge to a spanning tree makes a cycle, and also its clear that one gets one unique cycle for every edge that is not in the spanning tree. Is this the definition of a "fundamental cycle"? linas ( talk) 23:12, 7 September 2008 (UTC)
Shouldnt the article mention that if the graph is considered as a topological space the cycle space is natually identified with the first homology group? 81.101.138.148 ( talk) 10:02, 14 October 2011 (UTC) That was me Billlion ( talk) 10:03, 14 October 2011 (UTC)