Recognizing sign solvable graphs

DOI10.1016/0166-218X(83)90079-3zbMath0524.05048WikidataQ127884012 ScholiaQ127884012MaRDI QIDQ585223

Pierre Hansen

Publication date: 1983

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

zbMATH Keywords

signed graphqualitative linear systemssign solvable graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Mathematical economics (91B99) Structural characterization of families of graphs (05C75)

Related Items (9)

Recursive structure of S-matrices and an \(O(m^ 2)\) algorithm for recognizing sign solvability ⋮ A qualitative analysis of \(\dot x=Ax+b\) ⋮ Qualitative comparative statics ⋮ Detecting stable matrices ⋮ Robust economic models ⋮ On the digraphs of sign solvable linear systems ⋮ Graph-theoretical approach to qualitative solvability of linear systems ⋮ Signsolvability revisited ⋮ On the recognition of \(S\)-systems

Cites Work

• Unnamed Item
• Unnamed Item
• Sign solvable graphs
• Graph-theoretical approach to qualitative solvability of linear systems
• A New Method of Checking the Consistency of Precedence Matrices
• Qualitative Economics and the Scope of the Correspondence Principle
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: Recognizing sign solvable graphs