# 距离 (图论)

## 例子

### 例2 - 直径和半径

 顶点 ${\displaystyle V_{1}}$ ${\displaystyle V_{2}}$ ${\displaystyle V_{3}}$ ${\displaystyle V_{4}}$ ${\displaystyle V_{5}}$ ${\displaystyle V_{6}}$ 偏心率 3 3 2 2 2 3

## 注释

1. ^ 两点间的最短路径也被称为图的测地线（英語：graph geodesic）。
2. ^ 见例1。
3. ^ 加权图的含义是每一条边可以有各自的长度。

## 参考资料

1. ^ Bouttier, Jérémie; Di Francesco,P.; Guitter, E. Geodesic distance in planar graphs. Nuclear Physics B. July 2003, 663 (3): 535–567 [2008-04-23]. doi:10.1016/S0550-3213(03)00355-9. （原始内容存档于2008-10-04）. By distance we mean here geodesic distance along the graph, namely the length of any shortest path between say two given faces
2. ^ Weisstein, Eric W. Graph Geodesic. MathWorld--A Wolfram Web Resource. Wolfram Research. [2008-04-23]. （原始内容存档于2008-04-23）. The length of the graph geodesic between these points d(u,v) is called the graph distance between u and v
3. ^ F. Harary. Graph Theory. Addison-Wesley. 1969: 199.
4. Chartrand G., Johns G., Oellermann O.R. On Peripheral Vertices in Graphs. Bodendiek R., Henn R. (编). Topics in Combinatorics and Graph Theory. Physica-Verlag HD. 1990.