×

A note on a matrix criterion for unique colorability of a signed graph. (English) Zbl 0184.49202


Keywords:

topology
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Cartwright, D. and Harary, F. Structural balance: A generalization of Heider’s theory.Psychological Review, 1956,63, 277–293.
[2] Cartwright, D., and Harary, F. On the coloring of signed graphs.Elemente der Mathematik, (in press). · Zbl 0155.31703
[3] Davis, J. A. Structural balance, mechanical solidarity and interpersonal relations.American Journal of Sociology, 1963,68, 444–462.
[4] Davis, J. A. Clustering and structural balance in graphs.Human Relations, 1964,20, 181–187.
[5] Feather, N. T. A structural balance model of communication effects.Psychological Review, 1964,71, 291–313.
[6] Harary, F., Norman, R. Z., and Cartwright, D.Structural models: an introduction to the theory of directed graphs. New York: Wiley, 1965. · Zbl 0139.41503
[7] Heider, F. Attitudes and cognitive organization.Journal of Psychology, 1946,21, 107–112.
[8] Heider, F.The Psychology of interpersonal relations. New York: Wiley, 1958.
[9] Kuethe, J. L. and De Soto, C. B. Grouping and ordering schemata in competition.Psychonomic Science, 1964,1, 115–116.
[10] Morrissette, J. An experimental study of the theory of structural balance.Human Relations, 1958,11, 239–254.
[11] Newcomb, T. M.The acquaintance process. New York: Holt, Rinehart, and Winston, 1961. · Zbl 0103.25202
[12] Rosenberg, M. J. and Abelson, R. P., An analysis of cognitive balancing. In C. I. Hovland and M. J. Rosenberg (Eds.),Attitude, organization and change. New Haven: Yale Univer. Press, 1960, 112–163.
[13] Zajone, R. B. and Burnstein, E. The learning of balanced and unbalanced social structures.Journal of Personality, 1965,33, 153–163.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.