Hypergraph Synthesis Method for Directed Fundamental Cutset Matrices

Huang Ruji

doi:10.13374/j.issn1001-053x.1992.02.011

Volume 14 Issue 2

Oct. 2021

Turn off MathJax

Article Contents

Article Navigation > Chinese Journal of Engineering > 1992 > 14(2): 185-193

Huang Ruji. Hypergraph Synthesis Method for Directed Fundamental Cutset Matrices[J]. Chinese Journal of Engineering, 1992, 14(2): 185-193. doi: 10.13374/j.issn1001-053x.1992.02.011

Citation:

Huang Ruji. Hypergraph Synthesis Method for Directed Fundamental Cutset Matrices[J]. Chinese Journal of Engineering, 1992, 14(2): 185-193. doi: 10.13374/j.issn1001-053x.1992.02.011

Huang Ruji. Hypergraph Synthesis Method for Directed Fundamental Cutset Matrices[J]. Chinese Journal of Engineering, 1992, 14(2): 185-193. doi: 10.13374/j.issn1001-053x.1992.02.011

Citation:

Huang Ruji. Hypergraph Synthesis Method for Directed Fundamental Cutset Matrices[J]. Chinese Journal of Engineering, 1992, 14(2): 185-193. doi: 10.13374/j.issn1001-053x.1992.02.011

PDF( 749 KB)

Hypergraph Synthesis Method for Directed Fundamental Cutset Matrices

doi: 10.13374/j.issn1001-053x.1992.02.011

Huang Ruji

Dept. of Automatic Control

Received Date: 1991-11-25
Available Online: 2021-10-16

Abstract

Abstract

By applying hypergraph theory, Algorithm RFCMHGT is presented for determing the realizability of a given directed fundamental cutset matrix Q_f and synthesizing its corresponding directed graph G layer by layer from its tree path submatrix Q_fp. Its principle is intuitive, and its computational complexity is O(nl²), where n and l are the numbers of rows and columns of Q_fp. Example 2 shows that Tutte's condition is not the sufficient condition for Q_f to he realizable.
- network topological synthesis,
- hypergraph,
- directed graph