3
个编辑
更改
跳到导航
跳到搜索
第1行：
第1行： − + + 第6行：
第7行： + + − + + − 一个具有6个顶点和7条边的图，其中最左边数字6的结点是叶子顶点（leaf vertex）或叫做终端顶点（pendant vertex）+ 第18行：
第22行： − + 第26行：
第30行： − 从图论的观点来看，顶点被视为无特征且不可分割的对象。但是根据图的应用场景，顶点可能有额外的结构。 例如：[[语义网络(计算机科学)]] ,其中的顶点表示概念或对象的类。+ 第34行：
第38行： − 形成边的两个顶点称为这条边的端点，这条边称为关联（incident）于这两个顶点的边。如果图包含一条边(''v''，''w'') ，则称一个顶点''w'' 与另一个顶点 ''v'' 相邻接（adjacent ）。顶点 v 的[[邻域]]（neighborhood）是该图的一个[[诱导子图]]（induced subgraph），由邻接于 v 的所有顶点构成。+
无编辑摘要
此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。
此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。
本词条由[[鲁鱼陶阴]]第一次整理，尚不完善，请见谅
本词条由[[鲁鱼陶阴]]第一次整理，尚不完善，请见谅。
{{Other uses|Vertex (disambiguation)}}
{{Other uses|Vertex (disambiguation)}}
{{more footnotes|date=February 2014}}
{{more footnotes|date=February 2014}}
'''<font color="#ff8000"> 橙</font>'''
'''<font color="#32CD32"> 绿</font>'''
[[Image:6n-graf.svg.png|thumb|一个具有6个顶点和7条边的图，其中最左边数字6的结点是叶子顶点（leaf vertex）或叫做终端顶点（pendant vertex）]]
[[Image:6n-graf.svg.png|thumb|A graph with 6 vertices and 7 edges where the vertex number 6 on the far-left is a leaf vertex or a pendant vertex
一个具有6个'''<font color="#ff8000"> 顶点</font>'''和7条边的图，其中最左边数字6的结点是'''<font color="#ff8000"> 叶顶点 Leaf Vertex</font>'''或叫做'''<font color="#ff8000"> 悬挂点 Pendant Vertex</font>''']]
A graph with 6 vertices and 7 edges where the vertex number 6 on the far-left is a leaf vertex or a pendant vertex
A graph with 6 vertices and 7 edges where the vertex number 6 on the far-left is a leaf vertex or a pendant vertex
一个具有6个'''<font color="#ff8000"> 顶点</font>'''和7条边的图，其中最左边数字6的结点是'''<font color="#ff8000"> 叶顶点 Leaf Vertex</font>'''或叫做'''<font color="#ff8000"> 悬挂点 Pendant Vertex</font>'''
In [[mathematics]], and more specifically in [[graph theory]], a '''vertex''' (plural '''vertices''') or '''node''' is the fundamental unit of which graphs are formed: an [[undirected graph]] consists of a set of vertices and a set of [[Edge (graph theory)|edges]] (unordered pairs of vertices), while a [[directed graph]] consists of a set of vertices and a set of arcs (ordered pairs of vertices). In a diagram of a graph, a vertex is usually represented by a circle with a label, and an edge is represented by a line or arrow extending from one vertex to another.
In [[mathematics]], and more specifically in [[graph theory]], a '''vertex''' (plural '''vertices''') or '''node''' is the fundamental unit of which graphs are formed: an [[undirected graph]] consists of a set of vertices and a set of [[Edge (graph theory)|edges]] (unordered pairs of vertices), while a [[directed graph]] consists of a set of vertices and a set of arcs (ordered pairs of vertices). In a diagram of a graph, a vertex is usually represented by a circle with a label, and an edge is represented by a line or arrow extending from one vertex to another.
In mathematics, and more specifically in graph theory, a vertex (plural vertices) or node is the fundamental unit of which graphs are formed: an undirected graph consists of a set of vertices and a set of edges (unordered pairs of vertices), while a directed graph consists of a set of vertices and a set of arcs (ordered pairs of vertices). In a diagram of a graph, a vertex is usually represented by a circle with a label, and an edge is represented by a line or arrow extending from one vertex to another.
In mathematics, and more specifically in graph theory, a vertex (plural vertices) or node is the fundamental unit of which graphs are formed: an undirected graph consists of a set of vertices and a set of edges (unordered pairs of vertices), while a directed graph consists of a set of vertices and a set of arcs (ordered pairs of vertices). In a diagram of a graph, a vertex is usually represented by a circle with a label, and an edge is represented by a line or arrow extending from one vertex to another.
在数学上，更具体地说在图论中，'''顶点'''或'''节点'''是形成图的基本单位: [[无向图]]由一组顶点和一组边(无序顶点对)组成，而[[有向图]]由一组顶点和一组弧(有序顶点对)组成。在图的图解表示中，顶点通常用带标签的圆来表示，而边则用从一个顶点延伸到另一个顶点的直线或箭头来表示。
在数学上，更具体地说在图论中，'''<font color="#ff8000"> 顶点</font>'''或'''<font color="#ff8000"> 节点</font>'''是形成图的基本单位: '''<font color="#ff8000"> 无向图</font>'''由一组'''<font color="#ff8000"> 顶点</font>'''和一组边(无序'''<font color="#ff8000"> 顶点</font>'''对)组成，而'''<font color="#ff8000"> [[有向图]]</font>'''由一组'''<font color="#ff8000"> 顶点</font>'''和一组弧(有序'''<font color="#ff8000"> 顶点</font>'''对)组成。在图的图解表示中，'''<font color="#ff8000"> 顶点</font>'''通常用带标签的圆来表示，而边则用从一个'''<font color="#ff8000"> 顶点</font>'''延伸到另一个'''<font color="#ff8000"> 顶点</font>'''的直线或箭头来表示。
From the point of view of graph theory, vertices are treated as featureless and indivisible objects, although they may have additional structure depending on the application from which the graph arises; for instance, a semantic network is a graph in which the vertices represent concepts or classes of objects.
From the point of view of graph theory, vertices are treated as featureless and indivisible objects, although they may have additional structure depending on the application from which the graph arises; for instance, a semantic network is a graph in which the vertices represent concepts or classes of objects.
从图论的观点来看，'''<font color="#ff8000"> 顶点</font>'''被视为无特征且不可分割的对象。但是根据图的应用场景，'''<font color="#ff8000"> 顶点</font>'''可能有额外的结构。 例如：'''<font color="#32CD32"> [[语义网络(计算机科学)]] ,其中的'''<font color="#ff8000"> 顶点</font>'''表示概念或对象的类。</font>'''
The two vertices forming an edge are said to be the endpoints of this edge, and the edge is said to be incident to the vertices. A vertex w is said to be adjacent to another vertex v if the graph contains an edge (v,w). The neighborhood of a vertex v is an induced subgraph of the graph, formed by all vertices adjacent to v.
The two vertices forming an edge are said to be the endpoints of this edge, and the edge is said to be incident to the vertices. A vertex w is said to be adjacent to another vertex v if the graph contains an edge (v,w). The neighborhood of a vertex v is an induced subgraph of the graph, formed by all vertices adjacent to v.
形成边的两个'''<font color="#ff8000"> 顶点</font>'''称为这条边的'''<font color="#ff8000"> 端点</font>'''，这条边称为'''<font color="#ff8000"> 关联Incident</font>'''于这两个'''<font color="#ff8000"> 顶点</font>'''的边。如果图包含一条边(''v''，''w'') ，则称一个'''<font color="#ff8000"> 顶点</font>'''''w'' 与另一个'''<font color="#ff8000"> 顶点</font>''' ''v'' '''<font color="#ff8000">相邻接 Adjacent </font>'''。'''<font color="#ff8000"> 顶点</font>''' v 的[[邻域]]（neighborhood）是该图的一个'''<font color="#ff8000"> 导出子图</font>'''（induced subgraph），由邻接于 "v" 的所有'''<font color="#ff8000"> 顶点</font>'''构成。
==Types of vertices==
==Types of vertices==