On Okada's method for realizing cut-set matrices

DOI10.1016/0095-8956(71)90072-4MaRDI QIDQ2532129zbMATH OpenOpenAlexFDO

Authors K. P. Rajappan, A. H. Stone

Publication date 1971

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0095-8956(71)90072-4

zbMATH Keywords

topology

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites work

• An Algorithm for Determining Whether a Given Binary Matroid is Graphic
• From Matrices to Graphs
• Graphs and Vector Spaces
• scientific article; zbMATH DE number 3167398 (Why is no real title available?)
• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 3229058 (Why is no real title available?)
• scientific article; zbMATH DE number 3235858 (Why is no real title available?)
• scientific article; zbMATH DE number 3276429 (Why is no real title available?)
• scientific article; zbMATH DE number 3331274 (Why is no real title available?)
• scientific article; zbMATH DE number 3194440 (Why is no real title available?)
• scientific article; zbMATH DE number 3200333 (Why is no real title available?)
• Matroids and Graphs
• Solution to the realizability problem for irredundant Boolean branch- networks
• Synthesis of Switching Functions by Linear Graph Theory

This page was built for publication: On Okada's method for realizing cut-set matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2532129)