Advanced Search
Volume 7 Issue 4
Jul.  1985
Turn off MathJax
Article Contents
Huang Ruji. COMPLETE DIRECTED TREES ANALYSIS METHOD FOR LINEAR ACTIVE NETWORKS[J]. Journal of Electronics & Information Technology, 1985, 7(4): 254-266.
Citation: Huang Ruji. COMPLETE DIRECTED TREES ANALYSIS METHOD FOR LINEAR ACTIVE NETWORKS[J]. Journal of Electronics & Information Technology, 1985, 7(4): 254-266.

COMPLETE DIRECTED TREES ANALYSIS METHOD FOR LINEAR ACTIVE NETWORKS

  • Received Date: 1983-09-16
  • Rev Recd Date: 1984-11-06
  • Publish Date: 1985-07-19
  • The concepts of positive (negative) root complete directed trees and positive (negative) root complete directed k-trees and a positive (negative) root complete directed trees analysis method for linear active networks are presented. This method is the unification of complete trees method and directed trees method. It does not involve any sign problem and cancellation terms problem.
  • loading
  • W. Mayeda, Graph Theory, John Wiley and Sons, Inc., 1972, Ch. 8.[2]S. P. Chan, Introductory Topological Analysis of Electrical Networks, New York: Holt, Rinehart and Winston, 1969, Ch. 8.[3]W. K. Chen, Applied Graph Theory, Amsterdam: North-Holland, 1976, Ch. 4[4]陈树柏主编,网络图论及其应用,科学出版社,1982,第七章.[5]黄汝激,有源网络不定导纳矩阵一般k阶余因式的拓扑表达式,电子科学学刊,2(1985),81.[6]W K. Chen, IEEE Trans. on CT, CT-19 (1972), 241.[7]黄汝激,Chan-Mai,图定理的改进,北京钢铁学院学报,1982年,第2期,第83页.[8]W .Mayeda, S. L. Hakimi,W.K. Chen and N. Deo, IEEE Trans. on CT, CT-15 (1968), 101.
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (1753) PDF downloads(393) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return