摘要
拟裂子网络的可解性问题,是电网络理论的基础研究课题之一。本文不仅给出了可解性的数学表达式条件,而且给出了等效的拓扑条件。这对如何有效地选择测试点具有直观的指导意义。
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.
基金
国家自然科学基金
关键词
电路
网络
拟裂子
可解性
拓扑条件
Pseudo-tearing subnetwork
Indirectly accessible nodes
Distinct ended-nodes independent paths
