Structural cohesion
http://dbpedia.org/resource/Structural_cohesion an entity of type: WikicatSocialNetworks
Cohesió estructural és una concepció sociològica de cohesió en grups socials. Es defineix com el mínim nombre d'actors en una xarxa social que cal eliminar per desconnectar almenys dos actors del grup restant.
rdf:langString
In sociology, structural cohesion is the conception of a useful formal definition and measure of cohesion in social groups. It is defined as the minimal number of actors in a social network that need to be removed to disconnect the group. It is thus identical to the question of the node connectivity of a given graph in discrete mathematics. The vertex-cut version of Menger's theorem also proves that the disconnection number is equivalent to a maximally sized group with a network in which every pair of persons has at least this number of separate paths between them. 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
rdf:langString
rdf:langString
Cohesió estructural
rdf:langString
Structural cohesion
xsd:integer
6524226
xsd:integer
1093324846
rdf:langString
Cohesió estructural és una concepció sociològica de cohesió en grups socials. Es defineix com el mínim nombre d'actors en una xarxa social que cal eliminar per desconnectar almenys dos actors del grup restant.
rdf:langString
In sociology, structural cohesion is the conception of a useful formal definition and measure of cohesion in social groups. It is defined as the minimal number of actors in a social network that need to be removed to disconnect the group. It is thus identical to the question of the node connectivity of a given graph in discrete mathematics. The vertex-cut version of Menger's theorem also proves that the disconnection number is equivalent to a maximally sized group with a network in which every pair of persons has at least this number of separate paths between them. 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. The boundaries of structural endogamy in a kinship group are a special case of structural cohesion.
xsd:nonNegativeInteger
4062