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. [pg 103 ISBN 1431-1550]
This disambiguation page lists articles associated with the same title. If an internal link led you here, you may wish to change the link to point directly to the intended article. |