论文信息 - On Okada's method for realizing cut-set matrices

On Okada's method for realizing cut-set matrices

Abstract A method for determining whether a given matrix is the cut-set matrix of some graph, and of finding this graph if it exists, has been given without proof by S. Okada. The present paper describes the method and supplies proofs.

K. P. Rajappan | A. H. Stone

[1] L. Auslander,et al. Incidence Matrices and Linear Graphs , 1959 .

[2] L. Lofgren. Solution to the realizability problem for irredundant Boolean branch-networks , 1959 .

[3] Roderick Gould. Graphs and Vector Spaces , 1958 .

[4] W. T. Tutte,et al. From Matrices to Graphs , 1964, Canadian Journal of Mathematics.

[5] E. A. Guillemin. How to grow your own trees from given cut-set or tie-set matrices , 1959, IRE Trans. Inf. Theory.

[6] Y. Moriwaki,et al. Realization of Boolean polynomials based on incidence matrices , 1959, IRE-AIEE-ACM '59 (Eastern).

[7] W. T. Tutte. Matroids and graphs , 1959 .

[8] S. Okada,et al. AMBIT REALIZATION OF CUT-SET MATRICES INTO GRAPHS , 1960 .

[9] W. Mayeda. Synthesis of Switching Functions by Linear Graph Theory , 1960, IBM J. Res. Dev..

[10] S. Okada,et al. Boolean two-terminal analysis and synthesis , 1961, SWCT.

[11] W. T. Tutte. An algorithm for determining whether a given binary matroid is graphic. , 1960 .

[12] L. Auslander,et al. On the Realization of a Linear Graph Given Its Algebraic Specification , 1961 .