closeness.vitality: Find the closeness vitality centrality in a strongly...
In centiserve: Find Graph Centrality Indices

Description Usage Arguments Details Value Author(s) References Examples

Closeness vitality of a node is the change in the sum of distances between all node pairs when excluding that node.

1 2	closeness.vitality(graph, vids = V(graph), mode = c("all", "out", "in"), weights = NULL)

`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 string, defined the types of the paths used for measuring the distance in directed graphs. 'in' measures the paths to a vertex, 'out' measures paths from a vertex, all uses undirected paths. This argument is ignored for undirected graphs.
`weights`	Possibly a numeric vector giving edge weights. If this is NULL, the default, and the graph has a weight edge attribute, then the attribute is used. If this is NA then no weights are used (even if the graph has a weight attribute).

More detail at Closeness Vitality

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

Mahdi Jalili m_jalili@farabi.tums.ac.ir

Brandes, U. & Erlebach, T. 2005. Network Analysis: Methodological Foundations, U.S. Government Printing Office.

1 2	g <- graph(c(1,2,2,3,3,4,4,2,1,4), directed=FALSE) closeness.vitality(g)

Loading required package: igraph

Attaching package: ‘igraph’

The following objects are masked from ‘package:stats’:

    decompose, spectrum

The following object is masked from ‘package:base’:

    union

Loading required package: Matrix
[1] 8 6 8 6