摘要
本文对拓扑公式中树及各类k_树提出了一种系统算法。由本算法求得的树及各类k_树的树支导纳乘积之和.都是以乘积表达式由图成批生成,且无重复项和对消项出现,使运算速度得到了大幅度提高。
The paper proposes a system algorithm of trees and all kinds of k trees in topological formula,from which the sums of admittance porducts of trees and branches of all kinds of k trees are found,which are expressing formulas of the products that are produced from graphs in batches,but have no repeating terms and offset,which enablees the calculation to speed up greatly.
出处
《吉林化工学院学报》
CAS
1989年第3期77-86,共10页
Journal of Jilin Institute of Chemical Technology
关键词
拓扑
网络
树
树支
系统算法
topology
network
tree
branch
matrix
sidemultitude
