graph.coreness            package:igraph            R Documentation

_K-_c_o_r_e _d_e_c_o_m_p_o_s_i_t_i_o_n _o_f _g_r_a_p_h_s

_D_e_s_c_r_i_p_t_i_o_n:

     The k-core of graph is a maximal subgraph in which each vertex has
     at least degree k. The coreness of a vertex is k if it belongs to
     the k-core but not to the (k+1)-core.

_U_s_a_g_e:

     graph.coreness(graph, mode=c("all", "out", "in"))

_A_r_g_u_m_e_n_t_s:

   graph: The input graph, it can be directed or undirected

    mode: The type of the core in directed graphs. Character constant,
          possible values: 'in': in-cores are computed, 'out':
          out-cores are computed, 'all': the corresponding undirected
          graph is considered. This argument is ignored for undirected
          graphs.

_D_e_t_a_i_l_s:

     The k-core of a graph is the maximal subgraph in which every
     vertex has at least degree k. The cores of a graph form layers:
     the (k+1)-core is always a subgraph of the k-core.

     This function calculates the coreness for each vertex.

_V_a_l_u_e:

     Numeric vector of integer numbers giving the coreness of each
     vertex.

_A_u_t_h_o_r(_s):

     Gabor Csardi csardi@rmki.kfki.hu

_R_e_f_e_r_e_n_c_e_s:

     Vladimir Batagelj, Matjaz Zaversnik: An O(m) Algorithm for Cores
     Decomposition of Networks, 2002

     Seidman S. B. (1983) Network structure and minimum degree, _Social
     Networks_, 5, 269-287.

_S_e_e _A_l_s_o:

     'degree'

_E_x_a_m_p_l_e_s:

     g <- graph.ring(10)
     g <- add.edges(g, c(0,1, 1,2, 0,2))
     graph.coreness(g)               

