Balancing signed graphs

DOI10.1016/0166-218X(81)90001-9MaRDI QIDQ1156154zbMATH OpenOpenAlexFDO

Authors Jin Akiyama, David Avis, Hiroshi Era, 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)

Cites work

• scientific article; zbMATH DE number 3629008 (Why is no real title available?)
• scientific article; zbMATH DE number 3641502 (Why is no real title available?)
• scientific article; zbMATH DE number 3228308 (Why is no real title available?)
• scientific article; zbMATH DE number 3419168 (Why is no real title available?)
• A Graph-Theoretic Equivalence for Integer Programs
• On the notion of balance of a signed graph
• Some simplified NP-complete graph problems
• The tail of the hypergeometric distribution
• Two-Processor Scheduling with Start-Times and Deadlines

Cited in

(11)

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

This page was built for publication: Balancing signed graphs

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