A Note on a Matrix Criterion for Unique Colorability of a Signed Graph
- 1 September 1967
- journal article
- Published by Cambridge University Press (CUP) in Psychometrika
- Vol. 32 (3) , 291-296
- https://doi.org/10.1007/bf02289592
Abstract
A signed graph,S, is colorable if its point set can be partitioned into subsets such that all positive lines join points of the same subset and all negative lines join points of different subsets.S is uniquely colorable if there is only one such partition. Developed in this note is a new matrix, called the type matrix of S, which provides a classification of the way pairs of points are joined in S. Such a classification yields a criterion for colorability and unique colorability.Keywords
This publication has 10 references indexed in Scilit:
- Clustering and Structural Balance in GraphsHuman Relations, 1967
- The learning of balanced and unbalanced social structures1Journal of Personality, 1965
- A structural balance model of communication effect.Psychological Review, 1964
- Grouping and ordering schemata in competitionPsychonomic Science, 1964
- Structural Balance, Mechanical Solidarity, and Interpersonal RelationsAmerican Journal of Sociology, 1963
- The acquaintance process.Published by American Psychological Association (APA) ,1961
- An Experimental Study of the Theory of Structural BalanceHuman Relations, 1958
- The psychology of interpersonal relations.Published by American Psychological Association (APA) ,1958
- Structural balance: a generalization of Heider's theory.Psychological Review, 1956
- Attitudes and Cognitive OrganizationThe Journal of Psychology, 1946