Graph theoretic blockings k‐plexes and k‐cutpoints

DOI10.1080/0022250X.1982.9989933zbMath0502.94011MaRDI QIDQ3968882

Martin G. Everett

Publication date: 1982

Published in: The Journal of Mathematical Sociology (Search for Journal in Brave)

zbMATH Keywords

cliquessocial networkcutpointk-plexEverett's graph theoretic blocking algorithm

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Integer programming (90C10) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15) Connectivity (05C40)

Related Items (1)

On detecting maximal quasi antagonistic communities in signed graphs

Cites Work

• Unnamed Item
• A graph‐theoretic definition of a sociometric clique†
• A graph‐theoretic generalization of the clique concept

This page was built for publication: Graph theoretic blockings k‐plexes and k‐cutpoints