| 1. | A tree is a connected graph with no cycles .
一个树是一个没有圈的连通图。 |
| 2. | G is a minimal connected graph .
G是一个极小连通图。 |
| 3. | An articulation point is a vertex of a connected graph which can be split to yield an unconnected graph .
如果一个连通图的一个顶点能被分割，从而使这图成为一个不连通图，则这个顶点称为断点。 |
| 4. | Extensibility of fully cycle of 5 - vertex connected graphs
点连通图的完全圈可扩性 |
| 5. | Covering a connected graph with bonds of minimum total size
连通图的极小键覆盖 |
| 6. | Structure of maximal critically 4 - connected graphs
一类极大临界4连通图的结构 |
| 7. | A sufficient condition for s - hamilton - connected graphs
连通图的一个充分条件 |
| 8. | A sufficient condition of hamilton connected graph
连通图的一个充分条件 |
| 9. | Bounds of the spectral radius of connected graphs
连通图的谱半径的界 |
| 10. | A note on edge reconstructions of graphs
连通图中可收缩边的存在定理 |
