Network theory and transversal matroids

DOI10.1016/0166-218X(80)90027-XzbMath0448.94009MaRDI QIDQ1147102

András Recski, Masao Iri

Publication date: 1980

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

data structurestransversal matroidsactive linear networkshierarchy of network devices

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Applications of design theory to circuits and networks (94C30) Applications of graph theory to circuits and networks (94C15)

Related Items

Structural solvability of systems of equations —A mathematical formulation for distinguishing accurate and inaccurate numbers in structural analysis of systems— ⋮ Combinatorial Canonical Form of Layered Mixed Matrices and Its Application to Block-Triangularization of Systems of Linear/Nonlinear Equations ⋮ Presentations of transversal valuated matroids ⋮ A module-theoretic approach to matroids ⋮ Applications of matroids in electric network theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on binary fundamental transversal matroids
• Sufficient conditions for the unique solvability of linear networks containing memoryless 2-ports
• SOME RESULTS ON TRANSVERSAL MATROIDS AND CONSTRUCTIONS FOR IDENTICALLY SELF-DUAL MATROIDS
• Unique solvability and order of complexity of linear networks containing memorylessn-ports
• Investigating solvability and complexity of linear active networks by means of matroids
• Transversals and matroid partition
• Systems of distinct representatives and linear algebra
• Characterizations of transversal matroids and their presentations