On the maximum and negative frustration indices of graphs

Abstract

A signed graph is a graph with signatures ($+1$ or $-1$) on its edges. A cycle is called positive if the product of its edge signatures is positive, and a signed graph is called balanced if each cycle in it is positive. The frustration index is the minimum number of edges whose deletion makes the signed graph balanced, which is considered to be a measurement of the imbalance of the signed graph. In this paper, we compare the frustration index of the all-negative signature with the maximum frustration index of all possible signatures on the unsigned graph. We classify some families of graphs into three scenarios: the all-negative signature does not maximise the frustration index, the all-negative signature maximises the frustration index non-uniquely, and the all-negative signature maximises the frustration index uniquely. For all three scenarios, we can exhibit chordal and non-chordal graphs alike. The classes we consider include apex trees, fan graphs, wheel graphs, and complete split graphs. Moreover, for the families of fan graphs and wheel graphs, we fully characterise and count the signatures maximising the frustration index. Throughout our study, we exhibit different classes of signed graphs for which the frustration index equals the number of edge-disjoint negative triangles. Moreover, as part of our study, we are able to refute three conjectures of Zaslavsky on the frustration index.