应用它可以扩大一台计算机所能拓扑分析的电网络的规模，而且表达式紧凑。
Using it the scale of electrical networks which can be topologically analysed by a computer will be increased, and the result expressions are terse.
对于具有重要意义的终周期揉序列对，给出了决定其拓扑熵的揉行列式的解析表达式。
For the eventually periodic kneading pair of significance, the analytic expression of the kneading determinant for determining its topological entropy is presented.
本文不仅给出了可解性的数学表达式条件，而且给出了等效的拓扑条件。
The results presented would be not only a mathematical conditions, but also a topological conditions for subnetwork solvability.
应用推荐