Lesson plan

Graph center

The center (or Jordan center ) of a graph is the set of all vertices of minimum eccentricity, that is, the set of all vertices u where the greatest distance d(u,v) to other vertices v is minimal. Equivalently, it is the set of vertices with eccentricity equal to the graph's radius. Thus vertices in the center (central points) minimize the maximal distance from other points in the graph. This is also known as the vertex 1-center problem and can be extended to the vertex k-center problem. Finding the center of a graph is useful in facility location problems where the goal is to minimize the worst-case distance to the facility. For example, placing a hospital at a central point reduces the longest distance the ambulance has to travel. The center can be found using the Floyd–Warshall algorithm. Another algorithm has been proposed based on matrix calculus. The concept of the center of a graph is related to the closeness centrality measure in social network analysis, which is the reciprocal of the mean of the distances d(A,B).

Back to article

Article summary

The center (or Jordan center ) of a graph is the set of all vertices of minimum eccentricity, that is, the set of all vertices u where the greatest distance d(u,v) to other vertices v is minimal. Equivalently, it is the set of vertices with eccentricity equal to the graph's radius. Thus vertices in the center (central points) minimize the maximal distance from other points in the graph. This is also known as the vertex 1-center problem and can be extended to the vertex k-center problem. Finding the center of a graph is useful in facility location problems where the goal is to minimize the worst-case distance to the facility. For example, placing a hospital at a central point reduces the longest distance the ambulance has to travel. The center can be found using the Floyd–Warshall algorithm. Another algorithm has been proposed based on matrix calculus. The concept of the center of a graph is related to the closeness centrality measure in social network analysis, which is the reciprocal of the mean of the distances d(A,B).

Key claims

No claims recorded.

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  3. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

No sources recorded.

Key claims and bibliography are generated from the same tracked claims and sources as the article page.