What is the diameter of a graph?

Diameter is terminology in graph theory.

The diameter of a graph is the maximum distance between any two vertices. (The distance between two vertices is the minimum number of edges one needs to travel to get from one vertex to another.)

/
直径とは，グラフ理論における用語です．

あるグラフの直径とは，そのグラフの任意の2点間の距離の最大値です．（2点間の距離とは，一方の頂点から他方へ至るために通る必要のある辺の本数の最小値です．）