Geodetic graph
Материал из WikiGrapp
Geodetic graph --- геодезический граф.
[math]\displaystyle{ G }[/math] is a geodetic graph if for every pair of vertices there is a unique path of minimal length between them. See also Weakly geodetic graph.
Geodetic graph --- геодезический граф.
[math]\displaystyle{ G }[/math] is a geodetic graph if for every pair of vertices there is a unique path of minimal length between them. See also Weakly geodetic graph.