Description Usage Arguments Details Value Author(s) References Examples

The Laplacian centrality with respect to v is:

*C(v,L)=Delta E(v)=d(G)^2(v)+d(G)(v)+2 * sum(d(G)(v(i)), v(i) in N(v))*

where G is a graph of *n* vertices, *N(v)* is the set of neighbors of *v* in G and *d(G)(v(i))* is the degree of *v(i)* in G.

1 2 |

`graph` |
The input graph as igraph object |

`vids` |
Vertex sequence, the vertices for which the centrality values are returned. Default is all vertices. |

`mode` |
Character constatnt, it specifies how to use the direction of the edges if a directed graph is analyzed. For 'out' only the outgoing edges are followed. For 'in' all vertices from which the source vertex is reachable in at most order steps are counted. 'all' ignores the direction of the edges. This argument is ignored for undirected graphs. |

`loops` |
Logical; whether the loop edges are also counted. |

Laplacian centrality is a simple centrality measure that can be calculated in linear time. It is defined as the drop in the Laplacian energy (i.e. sum of squares of the eigenvalues in the Laplacian matrix) of the graph when the vertex is removed.

More detail at Laplacian Centrality

A numeric vector contaning the centrality scores for the selected vertices.

Mahdi Jalili [email protected]

Qi, Xingqin, et al. "Laplacian centrality: A new centrality measure for weighted networks." Information Sciences 194 (2012): 240-253.

1 2 |

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.