Cocycle

From Wikipedia, the free encyclopedia
Jump to: navigation, search

A cocycle refers to any one of the following:

Let G be a graph with vertex set V. A cut is a partition S = {X, X'} of V into two nonempty subsets. We denote the set of all edges incident with one vertex in X and one vertex in X' by E(S) or E(X, X'); and any such edge set is called a cocycle.

[edit] See also

[edit] Notes

  1. ^ Warner, Frank W. (1983).  page 173

[edit] References

  • Warner, Frank W. (1983). Foundations of Differentiable Manifolds and Lie Groups. New York: Springer. ISBN 0-387-90894-3. 


Personal tools
Namespaces

Variants
Actions
Navigation
Interaction
Toolbox
Print/export