An algorithm for identifying Morishima and anti-Morishima matrices and balanced digraphs

DOI10.1016/0165-4896(83)90050-1zbMath0567.05038OpenAlexW2018668402MaRDI QIDQ1059646

Stuart J. Maybee, John S. Maybee

Publication date: 1983

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0165-4896(83)90050-1

zbMATH Keywords

signed graphbalanced graphssigned digraphsanti-Morishima matricesdepth first

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)

Related Items

Detecting stable matrices ⋮ Robust economic models ⋮ The line index and minimum cut of weighted graphs

Cites Work

• Unnamed Item
• A simple algorithm to detect balance in signed graphs
• Mechanical vibration trees
• On the computational power of pushdown automata
• On the notion of balance of a signed graph
• Some Aspects of the Theory of $PN$-Matrices
• Qualitative Problems in Matrix Theory
• Depth-First Search and Linear Graph Algorithms