更改

*A vertex with degree 0 is called an [[isolated vertex]].

*A vertex with degree 0 is called an [[isolated vertex]].

度值为0的顶点成为'''<font color="#ff8000">孤立顶点 Isolated Vertex</font>'''

度数为0的顶点成为'''<font color="#ff8000">孤立顶点 Isolated Vertex</font>'''

*A vertex with degree 1 is called a leaf vertex or end vertex, and the edge incident with that vertex is called a pendant edge. In the graph on the right, {3,5} is a pendant edge. This terminology is common in the study of [[tree (graph theory)|tree]]s in graph theory and especially [[tree (data structure)|tree]]s as [[data structure]]s.

*A vertex with degree 1 is called a leaf vertex or end vertex, and the edge incident with that vertex is called a pendant edge. In the graph on the right, {3,5} is a pendant edge. This terminology is common in the study of [[tree (graph theory)|tree]]s in graph theory and especially [[tree (data structure)|tree]]s as [[data structure]]s.

度值为1的顶点称为叶顶点或尾顶点，该顶点的入射边称为'''<font color="#ff8000">悬挂边 Pendant Edge</font>'''。在右侧的图中，{3,5}就是一个悬挂边。在图论中，该术语主要在研究'''<font color="#ff8000">树 Tree</font>'''时使用，特别是具有树形结构的数据。

度数为1的顶点称为叶顶点或尾顶点，该顶点的入射边称为'''<font color="#ff8000">悬挂边 Pendant Edge</font>'''。在右侧的图中，{3,5}就是一个悬挂边。在图论中，该术语主要在研究'''<font color="#ff8000">树 Tree</font>'''时使用，特别是具有树形结构的数据。

* A vertex with degree ''n''&nbsp;&minus;&nbsp;1  in a graph on ''n'' vertices is called a [[dominating vertex]].

* A vertex with degree ''n''&nbsp;&minus;&nbsp;1  in a graph on ''n'' vertices is called a [[dominating vertex]].

在有n个顶点的图中，度值为n-1的顶点叫作'''<font color="#ff8000">主导顶点 Dominating Vertex</font>'''

在有n个顶点的图中，度数为n-1的顶点叫作'''<font color="#ff8000">主导顶点 Dominating Vertex</font>'''

 

==Global properties==

==Global properties==