Skip to main content
SpringerLink
Log in

Directedk-hypertree method for hypernetwork analysis

  • Published:
Journal of Electronics (China)

Abstract

The directed hypergraph theory is presented, and by applying it the directedk-hypertree method for hypernetwork analysis is derived. Using this method the scale of electrical networks which can be topologically analysed by a computer will be increased, and the resultant expressions are compact.

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. C. Berge, Graphs and Hypergraphs, Amsterdam: North-Holland, 1973, Chs. 3, 17.

    MATH  Google Scholar 

  2. Huang Ruji,Journal of Electronics (China) 2(1985), 177.

    Article  Google Scholar 

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

    MATH  Google Scholar 

  4. M.N.S. Swamy, Graphs, Networks and Algorithms, New York: John Wiley & Sons, 1981, Ch.4.

    MATH  Google Scholar 

  5. Daniel I.A. Cohen, Basic Techniques of Combinatorial Theory, New York: John Wiley & Sons, 1978, Ch.4.

    MATH  Google Scholar 

  6. W.K. Chen,IEEE Trans. on CT,CT-16(1969), 518.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Beijing College of Iron and Steel Technology, Beijing

    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. Directedk-hypertree method for hypernetwork analysis. J. of Electron.(China) 5, 105–116 (1988). https://doi.org/10.1007/BF02778815

Download citation

  • Issue Date:

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

Key words

Search

Navigation