Graph theoretic blockings k‐plexes and k‐cutpoints
Bibliographic Data
| ID | 10142314 |
|---|---|
| Authors | M G Everett (0000-0003-2465-1329, South Thames College, corresponding author) |
| Year | 1982 |
| Volume | 9 |
| Issue | 1 |
| Pages | 75-84 |
| Publication date | 1982-11-01 |
| Open Access | No |
| Type | ARTICLE |
| Venue | Journal of Mathematical Sociology (JOURNAL) |
| Journal identifiers | ISSN: 0022-250X • E-ISSN: 1545-5874 |
| Publisher | Taylor & Francis (PUBLISHER • GB) |
| DOI | 10.1080/0022250x.1982.9989933 |
| OpenAlex | W2052710990 |
| Language | EN |
| Citations received | 3 |
| References cited | 10 |
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 for finding a class of actors identified as important in Everett's paper
Class (philosophy · Combinatorics · Discrete mathematics · Graph · Mathematical economics · Artificial Intelligence · Cognitive and psychological constructs research · Computer Science · Constraint Satisfaction and Optimization · Data Visualization and Analytics · Mathematics
A Method of Matrix Analysis of Group Structure
An algorithm for clustering relational data with applications to social network analysis and comparison with multidimensional scaling
Graph Theory
The adolescent society
A graph theoretic blocking procedure for social networks
Structural equivalence
A graph‐theoretic definition of a sociometric clique
A note on the potential for genuine cross-fertilization between anthropology and mathematics
A graph-theoretic generalization of the clique concept
| Citations per year | 0.07 |
|---|---|
| Citation span | 1983 - 2001 (19) |
| Highly cited | No |