拟裂子网络可解性的拓扑条件
TOPOLOGICAL CONDITIONS FOR SOLVABILITY OF PSEUDO-TEARING SUBNETWORK
-
摘要: 拟裂子网络的可解性问题,是电网络理论的基础研究课题之一。本文不仅给出了可解性的数学表达式条件,而且给出了等效的拓扑条件。这对如何有效地选择测试点具有直观的指导意义。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.
-
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. -
计量
- 文章访问数: 1592
- HTML全文浏览量: 85
- PDF下载量: 505
- 被引次数: 0
下载:
