MODIFIED DOUBLE-GRAPH DECOMPOSITION ANALYSIS FOR FINDING SYMBOLIC NETWORK FUNCTIONS
求符号网络函数的变形双图分解分析法

The concepts of complementary cofactor pairs, normal double-graphs and feasible torn vertex sets are introduced. By using them a decomposition theorem for first-order cofactor C(Y) is derived. Combining it with the modified double-graph method, a new decomposition analysis-modified double-graph decomposition analysis is presented for finding symbolic network functions. Its advantages are that the resultant symbolic expressions are compact and contain no cancellation terms, and its sign evaluation is very simple.