A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
Inequalities for Laplacian Eigenvalues of Signed Graphs with Given Frustration Number
Balanced signed graphs appear in the context of social groups with symmetric relations between individuals where a positive edge represents friendship and a negative edge represents enmities between the individuals. The frustration number f of a signed graph is the size of the minimal set F of vertices whose removal results in a balanced signed graph; hence, a connected signed graph G˙ is balanced if and only if f=0. In this paper, we consider the balance of G˙ via the relationships between thedoi:10.3390/sym13101902 fatcat:xh35iommbzhcnjmf3kaphssn2q