摘要
对有源网络拓扑分析的 k-树组法进行了探讨,对现有定理作了一些发展,给出了顶点分类集合和 k-树组生成的算法.根据算法编制了计算机程序,并用它求出了有源网络的策动点导纳函数。
Topological analysis of active network by k-tree term is dicussed.Some exis- ting theorems are developed.Algorithms for generating vertex partition set and k-tree term are presented.A computer program has been compiled,it is used to find the driving point admittance function of active network.
关键词
有源网络
拓扑分析
K-树组
图论
k-tree term
directed graph
graph-theoretical algorithms
composite tree
