components  R Documentation 
These functions create a vector of nodes' memberships in components or degrees of coreness:
node_components()
assigns nodes' component membership
using edge direction where available.
node_weak_components()
assigns nodes' component membership
ignoring edge direction.
node_strong_components()
assigns nodes' component membership
based on edge direction.
node_roulette()
In graph theory, components, sometimes called connected components, are induced subgraphs from partitioning the nodes into disjoint sets. All nodes that are members of the same partition as i are reachable from i.
For directed networks, strongly connected components consist of subgraphs where there are paths in each direction between member nodes. Weakly connected components consist of subgraphs where there is a path in either direction between member nodes.
Coreness captures the maximal subgraphs in which each vertex has at least
degree k, where k is also the order of the subgraph.
As described in igraph::coreness
,
a node's coreness is k if it belongs to the kcore
but not to the (k+1)core.
node_components(.data)
node_weak_components(.data)
node_strong_components(.data)
.data 
An object of a

Other memberships:
cliques
,
community
,
core
,
equivalence
node_components(mpn_bristol)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.