DOCUMENTATION CENTER SEARCH

Graph Utilities Package >

Graph Utilities Package Symbol

Tutorials »|See Also »|More About »

ClosenessCentrality

ClosenessCentrality[g]
finds the closeness centrality.

MORE INFORMATION

To use ClosenessCentrality, you first need to load the Graph Utilities Package using Needs["GraphUtilities`"].

The closeness centrality of a vertex u is defined as the inverse of the sum of the distance from u to all other vertices. The closeness centrality of a vertex in a disconnected graph is based on the closeness centrality of the component where this vertex belongs.

The following options can be given:

	Weighted	True	whether edge weight is to be used in calculating distance
	Normalize	False	whether to normalize the output

Basic Examples (2)

Needs["GraphUtilities`"]

This defines a small graph:

This shows that vertex 2, being at the center of this graph, has a higher closeness centrality:

Needs["GraphUtilities`"]

This defines a disconnected graph and finds the closeness centrality:

Applications (1)

PageRanks

Graph Utilities Package

Graph Utilities Package

© 2008 Wolfram Research, Inc.

Ask a question about this page | Suggest an improvement | Leave a message for the team