2000 character limit reached
Frustration in signed graphs (1403.7212v1)
Published 27 Mar 2014 in math.CO
Abstract: Zaslavsky conjectured the following: The minimum number of vertices to be deleted to restore balance in a subcubic signed graph is the same as the minimum number of edges to be deleted to restore balance. We prove this conjecture. Also, we obtain a bound for these invariants in a special class of signed graphs.
Collections
Sign up for free to add this paper to one or more collections.