Skip to main content
SpringerLink
Log in

Complete directed tree analysis method for linear active networks

  • Published:
Journal of Electronics (China)

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. 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.

    Google Scholar 

  3. W. K. Chen, Applied Graph Theory, Amsterdam: North-Holland, 1976, Ch. 4.

    MATH  Google Scholar 

  4. W. K. Chen,IEEE Trans. on CT CT,-19 (1972), 241.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Beijing College of Iron and Steel Technology, Beijing, China

    Huang Ruji

Authors
  1. Huang Ruji
    View author publications

    You can also search for this author in PubMed Google Scholar

About this article

Cite this article

Ruji, H. Complete directed tree analysis method for linear active networks. J. of Electron. (China) 3, 23–35 (1986). https://doi.org/10.1007/BF02778891

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02778891

Keywords

Search

Navigation