Frustration in signed graphs

2014/03/27 by Sivaraman, Vaidy
#05C22 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1403.7212

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.

Related

• Frustration indices of signed subcubic graphs
• Frustration index of a signed planar graph and the feedback vertex set
• Critically 3-frustrated signed graphs
• An upper bound on the nullity of signed graphs
• Total graph of a signed graph