Cartwright and Harary considered graphs in which vertices represent persons and the edges represent symmetric dyadic relations amongst persons each of which designated as being positive or negative according to whether the nature of the relationship is positive (friendly, like, etc.) or negative (hostile, dislike, etc.). Such a network S is called a signed graph. Signed graphs are much studied in literature because of their extensive use in modeling a variety socio-psychological process and also because of their interesting connections with many classical mathematical systems