In the early 50's, F. Harary and D. Catwright used the Signed Graphs to modelize the socio-psychological theory of Balance. The signed graph is one in which all the edges are either positive or negative. It is balanced if all of its cycles are positive (the sign of a cycle being the product of its edges). A few decades later, J. L. Beauvois and G. Lopez defined the kinship graph in order to do further analysis in the psycho-mathematical theory of balance.

In the talk, I will be presenting some known results regarding these graphs. I will also define Rv(m,n), m<= n as the minimum number of K_{m} reversals in order to switch the signing of the edge set of a given signed K_{n}, in order to investigate R(3,n). I will also prove that for every signed graph G, there exists a kinship graph H of a signed graph F such that H contains G as an induced subgraph.