# Diameter (graph)
Last edited: 2026-02-19
Diameter
Given a graph $G$ the diameter of the graph is a maximum minimum path length between any two nodes in the graph.
Last edited: 2026-02-19
Given a graph $G$ the diameter of the graph is a maximum minimum path length between any two nodes in the graph.