[res] = eccentricity_centrality(G) is a array vector containing the statistic
for each node / vertex.
The eccentricity of a vertex j is the maximum of its finite distances to
all other vertices, i.e. ecc(j) = max(dij). Computationally, ecc(j) is
the maximum of each row of D(G). If all other vertices can be reached
from j, then ecc(j) is the maximum number of steps needed to reach all of
them. The radius of a digraph is the minimum eccentricity of all its
vertices, radius(G) = min(ecc(j)). The diameter of a digraph is the
maximum eccentricity, diameter(G) = max(ecc(j)).
See Also
closeness_centrality, bridging_centrality
Systems Biology and Evolution Toolbox (SBEToolbox).
Authors: James Cai, Kranti Konganti.
(C) Texas A&M University.
$LastChangedDate: 2012-07-25 15:43:46 -0500 (Wed, 25 Jul 2012) $
$LastChangedRevision: 216 $
$LastChangedBy: konganti $