References
- R. P. Abelson and M. J. Rosenberg, Symbolic psychologic:A model of attitudinal cognition, Behav. Sci., 3 (1958), 1-13.
- T. Zaslavsky, signed graphs, Discrete Appl. Math., 4(1)(1982), 47-74.
- T. Zaslavsky, A mathematical bibliography of signed and gain graphs and its allied areas, Electronic J. Combin., 8(1)(1998), Dynamic Surveys (1999), No. DS8.
- F. Harary, Graph Theory, Addison-Wesley Publishing Co., 1969.
- D. W. Cartwright and F. Harary, Structural balance: A generalization of Heider’s Theory, Psych. Rev., 63(1956), 277-293.
- G. T. Chartrand, Graphs as Mathematical Models, Prindle, Weber & Schmidt, Inc., Boston, Massachusetts 1977.
- F. Harary, R. Z. Norman and D. W. Cartwright, Structural models: An introduction to the theory of directed graphs, Wiley Inter-Science, Inc., New York, 1965.
- O. Katai and S. Iwai, Studies on the balancing, the minimal balancing, and the minimum balancing processes for social groups with planar and nonplanar graph structures, J. Math. Psychol., 18(1978), 140-176.
- F. S. Roberts, Graph Theory and its Applications to Problems of Society, SIAM, Philadelphia, PA, USA, 1978.
- F. S. Roberts and Shaoji Xu, Characterizations of consistent marked graphs, Discrete Applied Mathematics, 127(2003), 357-371.
- F. Harary, On the notion of balance of a signed graph, Michigan Math. J., 2(1953), 143-146.
- E. Sampathkumar, Point signed and line signed graphs, Nat. Acad. Sci. Letters, 7(3) (1984), 91-93.
- P. Siva Kota Reddy, B. Prashanth, and Kavitha. S.Permi, A note on antipodal signed graphs, International J. Math. Combin., 1(2011),107-112.
- Y. Hou, J. Li and Y. Pan (2003) On the Laplacian Eigenvalues of signed graphs, Linear and Multilinear Algebra,51:1, 21-30, DOI:10.1080/0308108031000053611
- F. Belardo, S. K. Simič, On the Laplacian coefficients of signed graphs, Linear Algebra and Its Applications, 475(2015),94-113
- F. Harary and J.A. Kabell, Counting balanced signed graphs using marked graphs, Proc. Edinburgh Math. Soc., 24 (2)(1981),99-104.
- T. Zaslavsky (1982). signed graphs. Discrete Appl. Math., 4, 4774.