A Coding Approach to Signed Graphs

DOI10.1137/S0895480189174374MaRDI QIDQ4317699zbMATH OpenOpenAlexFDO

Authors Thomas Zaslavsky, Patrick Solé

Publication date 20 December 1994

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895480189174374

zbMATH Keywords

line index of imbalancelower boundsigned graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Combinatorial codes (94B25)

Recommendations

• A Dynamic Programming Algorithm To Test A Signed Graph For Balance
• scientific article; zbMATH DE number 1472163
• scientific article; zbMATH DE number 3887734
• scientific article; zbMATH DE number 1958615
• scientific article; zbMATH DE number 32031

Cited in

(13)

• The smallest surface that contains all signed graphs on \(K_{4, n}\)
• Cheeger constants, structural balance, and spectral clustering analysis for signed graphs
• Linear codes over signed graphs
• Computing the line index of balance using integer programming optimisation
• scientific article; zbMATH DE number 1958615 (Why is no real title available?)
• Network coding in undirected graphs is either very helpful or not helpful at all
• Further Algebraic Results in the Theory of Balance
• A Dynamic Programming Algorithm To Test A Signed Graph For Balance
• The largest demigenus over all signatures on \(K_{3,n}\)
• SIGNED COMPLETE GRAPHS ON SIX VERTICES AND THEIR FRUSTRATION INDICES
• Frustration and isoperimetric inequalities for signed graphs
• Induced signed graphs of some classes of graphs
• Linear ternary codes of strongly regular signed graphs

This page was built for publication: A Coding Approach to Signed Graphs

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