DIRECTED k-HYPERTREE METHOD FOR HYPERNETWORK ANALYSIS

Huang Ruji

Volume 9 Issue 3

May 1987

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 1987 > 9(3): 244-255

Huang Ruji. DIRECTED k-HYPERTREE METHOD FOR HYPERNETWORK ANALYSIS[J]. Journal of Electronics & Information Technology, 1987, 9(3): 244-255.

Citation:

Huang Ruji. DIRECTED k-HYPERTREE METHOD FOR HYPERNETWORK ANALYSIS[J]. Journal of Electronics & Information Technology, 1987, 9(3): 244-255.

Huang Ruji. DIRECTED k-HYPERTREE METHOD FOR HYPERNETWORK ANALYSIS[J]. Journal of Electronics & Information Technology, 1987, 9(3): 244-255.

Citation:

Huang Ruji. DIRECTED k-HYPERTREE METHOD FOR HYPERNETWORK ANALYSIS[J]. Journal of Electronics & Information Technology, 1987, 9(3): 244-255.

PDF( 2554 KB)

DIRECTED k-HYPERTREE METHOD FOR HYPERNETWORK ANALYSIS

Huang Ruji

Received Date: 1985-03-21
Rev Recd Date: 1987-01-11
Publish Date: 1987-05-19

Abstract

Abstract

The directed hypergraph theory is presented, and by applying it the directed k-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.

FullText(HTML)

References(1)

References

C. Berge, Graph and Hypergraph, Amsterdam: North-Holland, 1973, Chs.3,17.[2]黄汝激,电子科学学刊,7(1985), 81.[3]W. K. Chen, Applied Graph Theory, Amsterdam: North-Holland, 1976. Chs.4,5.[4]M. N. S. Swamy, Graphs, Networks and Algorithms, New York, John Wiley and Sons, 1981, Ch. 4.[5]Daniel I. A. Cohen. Basic Techniques of Combinatorial Theory, New York, John Wiley and Sons, 1978, Ch.4. [6] W. K. Chen, IEEE Trans. on CT, CT-16(1969), 518.[6]陆生勋,电子科学学刊,5(1983), 210.[7]黄汝激,电子科学学刊,8(1986), 335.[8]黄汝激,混合图的有向k树多项式的产生和状态空间树,电子学报(即将发表).

Relative Articles

Supplements(0)

Cited By

Proportional views