Now showing items 1-6 of 6
The number of ways to label a structure
(Springer-Verlag; Psychometric Society, 1967-06)
It has been observed that the number of different ways in which a graph with p points can be labelled is p ! divided by the number of symmetries, and that this holds regardless of the species of structure at hand. In this ...
The probability of a given 1-choice structure
(Springer-Verlag; Psychometric Society, 1966-06)
A 1-choice structure arises whenever each person in a group chooses exactly one other person according to some criterion. Our purpose is to study the situation in which these choices are made at random. As noted in Harary, ...
Recent results in topological graph theory
(Kluwer Academic Publishers; Akadémiai Kiadó ; Springer Science+Business Media, 1964-09)
A graph theoretic approach to matrix inversion by partitioning
(Springer-Verlag, 1962-12)
Let M be a square matrix whose entries are in some field. Our object is to find a permutation matrix P such that PM P −1 is completely reduced, i.e., is partitioned in block triangular form, so that all submatrices below ...
A graph theoretic approach to similarity relations
(Springer-Verlag; Psychometric Society, 1964-06)
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 ...