Advertisement

Journal of Electronics (China)

, Volume 3, Issue 1, pp 23–35 | Cite as

Complete directed tree analysis method for linear active networks

  • Huang Ruji
Article
  • 14 Downloads

Abstract

This paper introduces the concepts of positive-(negative-) root complete directed trees and positive-(negative-) root complete directedk-trees, and presents a positive-(negative-) root complete directed tree analysis method for linear active networks. This method is the unification of complete tree method and directed tree method. It does not involve any sign problem and cancellation term problem.

Keywords

Primary Vertex Couple Element Primary Path Active Edge Secondary Vertex 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    W. mayeda, Graph Theory, John Wiley and Sons, Inc., 1972, Ch. 8.Google Scholar
  2. [2]
    S. P. Chan, Introductory Topological Analysis of Electrical Networks, New York: Holt, Rinehart and Winston, 1969, Ch. 8.Google Scholar
  3. [3]
    W. K. Chen, Applied Graph Theory, Amsterdam: North-Holland, 1976, Ch. 4.MATHGoogle Scholar
  4. [6]
    W. K. Chen,IEEE Trans. on CT CT,-19 (1972), 241.Google Scholar

Copyright information

© Science Press 1986

Authors and Affiliations

  • Huang Ruji
    • 1
  1. 1.Beijing College of Iron and Steel TechnologyBeijingChina

Personalised recommendations