GraphTheory - Maple Programming Help

Online Help

All Products    Maple    MapleSim


Home : Support : Online Help : Mathematics : Discrete Mathematics : Graph Theory : GraphTheory Package : GraphTheory/ClosenessCentrality

GraphTheory

  

ClosenessCentrality

  

compute closeness centrality

 

Calling Sequence

Parameters

Description

Examples

Compatibility

Calling Sequence

ClosenessCentrality(G)

ClosenessCentrality(G, v)

Parameters

G

-

graph

v

-

(optional) a vertex of G

Description

• 

ClosenessCentrality returns the closeness centrality for a specified vertex in the the given graph G, or if no vertex is specified, returns a list of the closeness centralities for each vertex in G.

• 

The closeness centrality of a vertex v is the reciprocal of the average graph distance between v and every vertex reachable from v.

Examples

withGraphTheory:

Compute the closeness centrality for a specified graph.

GGraph6,1,3,1,6,2,4,2,6,3,6,4,5,4,6,5,6

GGraph 1: an undirected unweighted graph with 6 vertices and 8 edge(s)

(1)

DrawGraphG

ClosenessCentralityG

58,58,58,57,58,1

(2)

Compatibility

• 

The GraphTheory[ClosenessCentrality] command was introduced in Maple 2020.

• 

For more information on Maple 2020 changes, see Updates in Maple 2020.

See Also

BetweennessCentrality

DegreeCentrality

EigenvectorCentrality

HarmonicCentrality

InformationCentrality

KatzCentrality

PageRankCentrality