center of a graph
[no,rad] = graph_center(g)
integer
integer
graph_center
computes a center of the graph g
i.e. the
node for which the largest of the shortest paths to all the other nodes
is minimum. The lengths of the arcs are supposed to be integer (and the default
value is 1).
The output is the value rad
of the length of the radius and
no
which is the node number of the center of the graph.
Harary, F. Graph Theory. Reading, MA: Addison-Wesley, p. 35, 1994.