A Graph Theoretic Approach to Similarity Relations
- 1 June 1964
- journal article
- Published by Cambridge University Press (CUP) in Psychometrika
- Vol. 29 (2) , 143-151
- https://doi.org/10.1007/bf02289696
Abstract
Summary: A similarity relation is reflexive and symmetric. A graph may be regarded as a geometric representation of an irreflexive symmetric relation; an r-graph then coincides with a similarity relation. For the realization of psychophysical phenomena, the points of a graph stand for the stimuli and a line for indistinguishability of a stimulus pair. Not all graphs, however, are likely to arise as similarity relations in a real situation. A special class of graphs, called interval graphs, does have this realistic property. These graphs are described and characterized.Keywords
This publication has 5 references indexed in Scilit:
- Representation of a finite graph by a set of intervals on the real lineFundamenta Mathematicae, 1962
- A Metric and an Ordering on SetsPsychometrika, 1959
- Graph Theoretic Methods in the Management SciencesManagement Science, 1959
- Structural balance: a generalization of Heider's theory.Psychological Review, 1956
- An axiomatic and experimental study of sensory order and measure.Psychological Review, 1956