TOPOLOGICAL CONDITIONS FOR SOLVABILITY OF PSEUDO-TEARING SUBNETWORK

Huang Dongquan

Volume 11 Issue 4

Jul. 1989

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 1989 > 11(4): 394-399

Huang Dongquan. TOPOLOGICAL CONDITIONS FOR SOLVABILITY OF PSEUDO-TEARING SUBNETWORK[J]. Journal of Electronics & Information Technology, 1989, 11(4): 394-399.

Citation:

Huang Dongquan. TOPOLOGICAL CONDITIONS FOR SOLVABILITY OF PSEUDO-TEARING SUBNETWORK[J]. Journal of Electronics & Information Technology, 1989, 11(4): 394-399.

Huang Dongquan. TOPOLOGICAL CONDITIONS FOR SOLVABILITY OF PSEUDO-TEARING SUBNETWORK[J]. Journal of Electronics & Information Technology, 1989, 11(4): 394-399.

Citation:

Huang Dongquan. TOPOLOGICAL CONDITIONS FOR SOLVABILITY OF PSEUDO-TEARING SUBNETWORK[J]. Journal of Electronics & Information Technology, 1989, 11(4): 394-399.

PDF( 973 KB)

TOPOLOGICAL CONDITIONS FOR SOLVABILITY OF PSEUDO-TEARING SUBNETWORK

Huang Dongquan

Received Date: 1988-04-19
Rev Recd Date: 1988-12-20
Publish Date: 1989-07-19

Abstract

Abstract

The problem for the solvability of pseudo-tearing subnetwark is one of essential investigations of network theory. The results presented would be not only a mathematical conditions, but also a topological conditions for subnetwork solvability. It should guide intuitively to the design of accessible nodes.

FullText(HTML)

References(1)

References

A. E. Salsms, et al.,IEEE Trans. on CAS, CAS-31(1984)7, 609-621.[2]H. Gupta, et al., A Hierarchical Decomposition Approach for Network Analysis, Proc. IEEE Int, Symp. Circuits and Systems, 1982, pp, 643-646.[3]黄东泉,电子学报,1984年, 第4期, 第28-34页.[4]Z. F. Huang, et al., IEEE Trans.on CAS, CAS-30(1983)5, 257-265.[5]黄东泉,西安交通大学学报,1982年,第6期, 第65-73页.[6]T. Qzawa, et al., IEEE Trans. on CAS, CAS-30(1983)7, 432-440.

Relative Articles

Supplements(0)

Cited By

Proportional views