Structural cohesion

Wikipedia, the free encyclopedia - Cite This Source

Structural cohesion is the sociological and graph theory conception and measurement of cohesion for maximal social group or graphical boundaries where related elements cannot be disconnected except by removal of a certain minimal number of other nodes. The solution to the boundary problem for structural cohesion is found by the vertex-cut version of Menger's theorem. The boundaries of structural endogamy are a special case of structural cohesion. It is also useful to know that k-cohesive graphs (or k-components) are always a subgraph of a k-core, although a k-core is not always k-cohesive. A k-core is simply a subgraph in which all nodes have at least k neighbors but it need not even be connected.

Examples

Some illustrative examples are presented in the gallery below:

See also

• Social network
• Social-circles network model

References

Wikipedia, the free encyclopedia © 2001-2006 Wikipedia contributors (Disclaimer)
This article is licensed under the GNU Free Documentation License.
Last updated on Saturday February 09, 2008 at 17:28:38 PST (GMT -0800)
View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation