Advanced Search
Volume 8 Issue 5
Sep.  1986
Turn off MathJax
Article Contents
Huang Ruji. PRIMARY SUBGRAPH METHOD FOR LINEAR ACTIVE NETWORK ANALYSIS[J]. Journal of Electronics & Information Technology, 1986, 8(5): 335-342.
Citation: Huang Ruji. PRIMARY SUBGRAPH METHOD FOR LINEAR ACTIVE NETWORK ANALYSIS[J]. Journal of Electronics & Information Technology, 1986, 8(5): 335-342.

PRIMARY SUBGRAPH METHOD FOR LINEAR ACTIVE NETWORK ANALYSIS

  • Received Date: 1985-01-03
  • Rev Recd Date: 1985-04-19
  • Publish Date: 1986-09-19
  • In this paper, the concept of the primary subgraph of a composite graph associated with a linear active network is introduced, and a new topological method, called the primary subgraph method, for linear active network analysis is presented. This method is the reform and unification of the complete tree method and directed tree method. It has solved the sign evaluation problem and eancellation term problem. Its sign evaluation is far simpler than the complete tree method. It is superior to the directed tree method since it has no cancellation terms.
  • loading
  • W. Mayeda, Graph Theory, New York: John Wiley and Sons, Inc., 1972, chap. 8.[2]W. K. Chen, Applied Graph Theory, Amsterdam: North-Holland, 1976, chap. 4.[3]W. K. Chen, IEEE Trans. on CT, CT-13(1966), 438.[4]黄汝激,电子科学学刊, 7(1985), 81.[5]黄汝激,电子科学学刊,7(1985), 254.[6]W. K, Chen, IEEE Trans. on CT, CT-19(1972), 241.[7]W. Mayeda, S. L. Hakimi,W.K, chen and N. Deo, ibid., CT-15 (1968 ), 101.
  • 加载中

Catalog

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

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

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

    Article Metrics

    Article views (1818) PDF downloads(364) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return