Resolution:
## Figure 2.
Two types of redundancy arise from linearly dependence. (a) A cycle c is decomposed into a tree path p_{2 }and a path p_{1 }that contains a non-tree edge e. So we have b= _{c }b+ _{p }b, where _{t}b, and _{c}, b_{p}bare constraints of cycle _{t }c, path p_{1 }and path p_{2}, respectively. The dotted line represents the non-tree edge e. (b) nis the node closest to _{l }non the path _{i }p_{3}. Assume that the constraint of tree path pis _{i }b, 1 ≤ _{i}i ≤ 6. We have b_{1 }= b_{4 }+ b_{6}, b_{2 }= b_{4 }+ b_{5}, and b_{3 }= b_{5 }+ b_{6}, which conclude that b_{1 }= b_{2 }+ b_{3 }due to the addition over GF(2).
Lai |