A Coding Approach to Signed Graphs

DOI10.1137/S0895480189174374zbMath0811.05034OpenAlexW2085574060MaRDI QIDQ4317699

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

lower boundsigned graphline index of imbalance

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)

Related Items (6)

SIGNED COMPLETE GRAPHS ON SIX VERTICES AND THEIR FRUSTRATION INDICES ⋮ Linear ternary codes of strongly regular signed graphs ⋮ The smallest surface that contains all signed graphs on \(K_{4, n}\) ⋮ The largest demigenus over all signatures on \(K_{3,n}\) ⋮ Cheeger constants, structural balance, and spectral clustering analysis for signed graphs ⋮ Linear codes over signed graphs

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