Balancing signed graphs

DOI10.1016/0166-218X(81)90001-9zbMath0468.05066OpenAlexW2006143798MaRDI QIDQ1156154

Hiroshi Era, Jin Akiyama, David Avis, Vašek Chvátal

Publication date: 1981

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

Full work available at URL: https://doi.org/10.1016/0166-218x(81)90001-9

zbMATH Keywords

signed graphbalanced graph

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items

Negative (and positive) circles in signed graphs: a problem collection, A method of enumeration of negative cycles of a signed graph, Isoperimetric numbers of graph bundles, Bounding the largest eigenvalue of signed graphs, Switched signed graphs of integer additive set-valued signed graphs, Approximation algorithms for maximum cut with limited unbalance, Rethinking structural balance in signed social networks, Cheeger constants, structural balance, and spectral clustering analysis for signed graphs, Spectral aspects of symmetric matrix signings, Spectral aspects of symmetric matrix signings, The line index and minimum cut of weighted graphs

Cites Work

• Some simplified NP-complete graph problems
• The tail of the hypergeometric distribution
• On the notion of balance of a signed graph
• Two-Processor Scheduling with Start-Times and Deadlines
• A Graph-Theoretic Equivalence for Integer Programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item