Search

In this paper we examine some of the mathematical properties of Everett's graph theoretic blocking procedures. In particular we discuss how k-plexes are blocked by Everett's algorithm. We also give a mathematical definition and algorithm f or finding a class of actors identified as important in Everett's paper. [ABSTRACT FROM AUTHOR]

The intent of this paper is to provide a definition of a sociometric clique in the language of graph theory. This problem is viewed from two perspectives: maintaining fidelity to the intuitive notion of a clique; and providing adequate computational mechanics for large bodies of data. Luce's (1950) concept of an n-clique is used, but further qualifications are added. Two statistics or measures with associated probability distributions are defined for testing the adequacy of a subgraph which qualifies according to the definition. [ABSTRACT FROM AUTHOR]