1,592
个编辑
更改
Moved page from wikipedia:en:Vertex (graph theory) (history)
此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。
{{Other uses|Vertex (disambiguation)}}
{{more footnotes|date=February 2014}}
[[Image:6n-graf.svg|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]]
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个顶点和7条边的图，其中最左边的顶点数6是一个叶顶点或一个吊坠顶点
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.
在数学上，更具体地说在图论中，顶点(复数顶点)或节点是形成图的基本单位: 无向图由一组顶点和一组边(无序顶点对)组成，而有向图由一组顶点和一组弧(有序顶点对)组成。在图的图中，顶点通常用带标签的圆来表示，而边则用从一个顶点延伸到另一个顶点的直线或箭头来表示。
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.
从图论的观点来看，顶点被看作是没有特征和不可分割的对象，尽管它们可能有额外的结构，这取决于图的应用程序; 例如，语义网络(计算机科学)是一个图，其中顶点表示概念或对象类。
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 (graph theory)|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.
形成边的两个顶点称为边的端点，边称为关联于顶点的边。如果图包含一条边(v，w) ，则称一个顶点 w 与另一个顶点 v 相邻。顶点 v 的邻域是图的导出子图，由邻接 v 的所有顶点构成。
==Types of vertices==
[[File:Small Network.png|alt=A small example network with 8 vertices and 10 edges.|thumb|Example network with 8 vertices (of which one is isolated) and 10 edges.]]
Example network with 8 vertices (of which one is isolated) and 10 edges.
具有8个顶点(其中一个是孤立的)和10条边的网络示例。
The [[degree (graph theory)|degree]] of a vertex, denoted 𝛿(v) in a graph is the number of edges incident to it. An '''isolated vertex''' is a vertex with degree zero; that is, a vertex that is not an endpoint of any edge (the example image illustrates one isolated vertex).<ref>[[:File:Small Network.png]]; example image of a network with 8 vertices and 10 edges</ref> A '''leaf vertex''' (also '''pendant vertex''') is a vertex with degree one. In a directed graph, one can distinguish the outdegree (number of outgoing edges), denoted 𝛿<sup> +</sup>(v), from the indegree (number of incoming edges), denoted 𝛿<sup>−</sup>(v); a '''source vertex''' is a vertex with indegree zero, while a '''sink vertex''' is a vertex with outdegree zero. A '''simplicial vertex''' is one whose neighbors form a [[clique (graph theory)|clique]]: every two neighbors are adjacent. A [[universal vertex]] is a vertex that is adjacent to every other vertex in the graph.
The degree of a vertex, denoted 𝛿(v) in a graph is the number of edges incident to it. An isolated vertex is a vertex with degree zero; that is, a vertex that is not an endpoint of any edge (the example image illustrates one isolated vertex). A leaf vertex (also pendant vertex) is a vertex with degree one. In a directed graph, one can distinguish the outdegree (number of outgoing edges), denoted 𝛿<sup> +</sup>(v), from the indegree (number of incoming edges), denoted 𝛿<sup>−</sup>(v); a source vertex is a vertex with indegree zero, while a sink vertex is a vertex with outdegree zero. A simplicial vertex is one whose neighbors form a clique: every two neighbors are adjacent. A universal vertex is a vertex that is adjacent to every other vertex in the graph.
图中表示(v)的顶点的度数是关联到它的边的数目。一个孤立的顶点是一个度为零的顶点，也就是说，一个顶点不是任何边的端点(示例图片显示了一个孤立的顶点)。叶顶点(也可以是悬垂顶点)是度数为1的顶点。在有向图中，我们可以区分外度(外出边数) ，表示 < sup > + </sup > (v) ，和外度(外入边数) ，表示 < sup >-</sup > (v) ; 源顶点是具有外度为零的顶点，而汇顶点是具有外度为零的顶点。单纯形顶点是邻接成团的顶点，每两个邻接是相邻的。通用顶点是图中与其他顶点相邻的顶点。
A [[cut vertex]] is a vertex the removal of which would disconnect the remaining graph; a [[vertex separator]] is a collection of vertices the removal of which would disconnect the remaining graph into small pieces. A [[k-vertex-connected graph]] is a graph in which removing fewer than ''k'' vertices always leaves the remaining graph connected. An [[Independent set (graph theory)|independent set]] is a set of vertices no two of which are adjacent, and a [[vertex cover]] is a set of vertices that includes at least one endpoint of each edge in the graph. The [[vertex space]] of a graph is a vector space having a set of basis vectors corresponding with the graph's vertices.
A cut vertex is a vertex the removal of which would disconnect the remaining graph; a vertex separator is a collection of vertices the removal of which would disconnect the remaining graph into small pieces. A k-vertex-connected graph is a graph in which removing fewer than k vertices always leaves the remaining graph connected. An independent set is a set of vertices no two of which are adjacent, and a vertex cover is a set of vertices that includes at least one endpoint of each edge in the graph. The vertex space of a graph is a vector space having a set of basis vectors corresponding with the graph's vertices.
割点是一个顶点，如果去掉这个顶点，就会断开剩余图的连接; 顶点分隔符是一组顶点的集合，如果去掉这些顶点，就会断开剩余图的连接。一个 k- 顶点连通图是这样一个图: 去掉少于 k 个顶点后，剩下的图仍然是连通的。一个独立的集合是一组顶点，没有两个是相邻的，顶点覆盖是一组顶点，包括图中每条边的至少一个端点。图的顶点空间是一个向量空间，它有一组与图的顶点相对应的基向量。
A graph is [[vertex-transitive graph|vertex-transitive]] if it has symmetries that map any vertex to any other vertex. In the context of [[graph enumeration]] and [[graph isomorphism]] it is important to distinguish between '''labeled vertices''' and '''unlabeled vertices'''. A labeled vertex is a vertex that is associated with extra information that enables it to be distinguished from other labeled vertices; two graphs can be considered isomorphic only if the correspondence between their vertices pairs up vertices with equal labels. An unlabeled vertex is one that can be substituted for any other vertex based only on its [[Adjacency (graph theory)|adjacencies]] in the graph and not based on any additional information.
A graph is vertex-transitive if it has symmetries that map any vertex to any other vertex. In the context of graph enumeration and graph isomorphism it is important to distinguish between labeled vertices and unlabeled vertices. A labeled vertex is a vertex that is associated with extra information that enables it to be distinguished from other labeled vertices; two graphs can be considered isomorphic only if the correspondence between their vertices pairs up vertices with equal labels. An unlabeled vertex is one that can be substituted for any other vertex based only on its adjacencies in the graph and not based on any additional information.
如果一个图具有将任何顶点映射到任何其他顶点的对称性，则该图是顶点传递的。在图计数和图同构的背景下，区分标记顶点和非标记顶点非常重要。标记顶点是与额外信息相关联的顶点，这些额外信息使得标记顶点能够与其他标记顶点区分开来; 只有当两个顶点之间的对应关系对应于具有相同标记的顶点时，两个图才可以被认为是同构的。一个未标记的顶点是一个可以替换的任何其他顶点只基于其邻接在图中，并没有任何额外的信息。
Vertices in graphs are analogous to, but not the same as, [[vertex (geometry)|vertices of polyhedra]]: the [[skeleton (topology)|skeleton]] of a polyhedron forms a graph, the vertices of which are the vertices of the polyhedron, but polyhedron vertices have additional structure (their geometric location) that is not assumed to be present in graph theory. The [[vertex figure]] of a vertex in a polyhedron is analogous to the neighborhood of a vertex in a graph.
Vertices in graphs are analogous to, but not the same as, vertices of polyhedra: the skeleton of a polyhedron forms a graph, the vertices of which are the vertices of the polyhedron, but polyhedron vertices have additional structure (their geometric location) that is not assumed to be present in graph theory. The vertex figure of a vertex in a polyhedron is analogous to the neighborhood of a vertex in a graph.
图中的顶点类似于多面体的顶点，但不同于多面体的顶点: 多面体的骨架构成一个图，其顶点是多面体的顶点，但多面体的顶点有附加的结构(几何位置) ，这在图论中是不存在的。多面体中顶点的顶点图形类似于图中顶点的邻域。
==See also==
* [[Node (computer science)]]
* [[Graph theory]]
* [[Glossary of graph theory]]
==References==
{{reflist}}
* {{cite journal
| last = Gallo
| last = Gallo
| last = Gallo
| first = Giorgio
| first = Giorgio
| first = Giorgio
| last2 = Pallotino
| last2 = Pallotino
2 = Pallotino
| first2 = Stefano
| first2 = Stefano
2 = Stefano
| title = Shortest path algorithms
| title = Shortest path algorithms
最短路径算法
| journal = Annals of Operations Research
| journal = Annals of Operations Research
运筹学年报
| volume = 13
| volume = 13
13
| issue = 1
| issue = 1
1
| pages = 1–79 <!-- the inline reference refers to page 4 -->
| pages = 1–79 <!-- the inline reference refers to page 4 -->
| pages = 1-79 < ! ! ——内联引用引用第4页 -- >
| year = 1988
| year = 1988
1988年
| doi = 10.1007/BF02288320
| doi = 10.1007/BF02288320
| doi = 10.1007/BF02288320
| ref=harv
| ref=harv
= harv
}}
}}
}}
* [[Claude Berge|Berge, Claude]], ''Théorie des graphes et ses applications''. Collection Universitaire de Mathématiques, II Dunod, Paris 1958, viii+277 pp. (English edition, Wiley 1961; Methuen & Co, New York 1962; Russian, Moscow 1961; Spanish, Mexico 1962; Roumanian, Bucharest 1969; Chinese, Shanghai 1963; Second printing of the 1962 first English edition. Dover, New York 2001)
* {{Cite book | last=Chartrand | first=Gary | authorlink=Gary Chartrand | title=Introductory graph theory | date=1985 | publisher=Dover | location=New York | isbn=0-486-24775-9 | pages= | url-access=registration | url=https://archive.org/details/introductorygrap0000char }}
* {{Cite book |author1=Biggs, Norman |author2=Lloyd, E. H. |author3=Wilson, Robin J. | title=Graph theory, 1736-1936 | date=1986 | publisher=Clarendon Press | location=Oxford [Oxfordshire] | isbn=0-19-853916-9 | pages=|title-link=Graph Theory, 1736–1936}}
* {{Cite book | last=Harary | first=Frank | authorlink=Frank Harary | title=Graph theory | date=1969 | publisher=Addison-Wesley Publishing | location=Reading, Mass. | isbn=0-201-41033-8 | pages=}}
* {{Cite book |author1=Harary, Frank |author2=Palmer, Edgar M. | title=Graphical enumeration | date=1973 | publisher=New York, Academic Press | location= | isbn=0-12-324245-2 | pages=}}
==External links==
*{{mathworld | title = Graph Vertex | urlname = GraphVertex}}
{{DEFAULTSORT:Vertex (Graph Theory)}}
[[Category:Graph theory]]
Category:Graph theory
范畴: 图论
<noinclude>
<small>This page was moved from [[wikipedia:en:Vertex (graph theory)]]. Its edit history can be viewed at [[顶点/edithistory]]</small></noinclude>
[[Category:待整理页面]]
{{Other uses|Vertex (disambiguation)}}
{{more footnotes|date=February 2014}}
[[Image:6n-graf.svg|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]]
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个顶点和7条边的图，其中最左边的顶点数6是一个叶顶点或一个吊坠顶点
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.
在数学上，更具体地说在图论中，顶点(复数顶点)或节点是形成图的基本单位: 无向图由一组顶点和一组边(无序顶点对)组成，而有向图由一组顶点和一组弧(有序顶点对)组成。在图的图中，顶点通常用带标签的圆来表示，而边则用从一个顶点延伸到另一个顶点的直线或箭头来表示。
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.
从图论的观点来看，顶点被看作是没有特征和不可分割的对象，尽管它们可能有额外的结构，这取决于图的应用程序; 例如，语义网络(计算机科学)是一个图，其中顶点表示概念或对象类。
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 (graph theory)|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.
形成边的两个顶点称为边的端点，边称为关联于顶点的边。如果图包含一条边(v，w) ，则称一个顶点 w 与另一个顶点 v 相邻。顶点 v 的邻域是图的导出子图，由邻接 v 的所有顶点构成。
==Types of vertices==
[[File:Small Network.png|alt=A small example network with 8 vertices and 10 edges.|thumb|Example network with 8 vertices (of which one is isolated) and 10 edges.]]
Example network with 8 vertices (of which one is isolated) and 10 edges.
具有8个顶点(其中一个是孤立的)和10条边的网络示例。
The [[degree (graph theory)|degree]] of a vertex, denoted 𝛿(v) in a graph is the number of edges incident to it. An '''isolated vertex''' is a vertex with degree zero; that is, a vertex that is not an endpoint of any edge (the example image illustrates one isolated vertex).<ref>[[:File:Small Network.png]]; example image of a network with 8 vertices and 10 edges</ref> A '''leaf vertex''' (also '''pendant vertex''') is a vertex with degree one. In a directed graph, one can distinguish the outdegree (number of outgoing edges), denoted 𝛿<sup> +</sup>(v), from the indegree (number of incoming edges), denoted 𝛿<sup>−</sup>(v); a '''source vertex''' is a vertex with indegree zero, while a '''sink vertex''' is a vertex with outdegree zero. A '''simplicial vertex''' is one whose neighbors form a [[clique (graph theory)|clique]]: every two neighbors are adjacent. A [[universal vertex]] is a vertex that is adjacent to every other vertex in the graph.
The degree of a vertex, denoted 𝛿(v) in a graph is the number of edges incident to it. An isolated vertex is a vertex with degree zero; that is, a vertex that is not an endpoint of any edge (the example image illustrates one isolated vertex). A leaf vertex (also pendant vertex) is a vertex with degree one. In a directed graph, one can distinguish the outdegree (number of outgoing edges), denoted 𝛿<sup> +</sup>(v), from the indegree (number of incoming edges), denoted 𝛿<sup>−</sup>(v); a source vertex is a vertex with indegree zero, while a sink vertex is a vertex with outdegree zero. A simplicial vertex is one whose neighbors form a clique: every two neighbors are adjacent. A universal vertex is a vertex that is adjacent to every other vertex in the graph.
图中表示(v)的顶点的度数是关联到它的边的数目。一个孤立的顶点是一个度为零的顶点，也就是说，一个顶点不是任何边的端点(示例图片显示了一个孤立的顶点)。叶顶点(也可以是悬垂顶点)是度数为1的顶点。在有向图中，我们可以区分外度(外出边数) ，表示 < sup > + </sup > (v) ，和外度(外入边数) ，表示 < sup >-</sup > (v) ; 源顶点是具有外度为零的顶点，而汇顶点是具有外度为零的顶点。单纯形顶点是邻接成团的顶点，每两个邻接是相邻的。通用顶点是图中与其他顶点相邻的顶点。
A [[cut vertex]] is a vertex the removal of which would disconnect the remaining graph; a [[vertex separator]] is a collection of vertices the removal of which would disconnect the remaining graph into small pieces. A [[k-vertex-connected graph]] is a graph in which removing fewer than ''k'' vertices always leaves the remaining graph connected. An [[Independent set (graph theory)|independent set]] is a set of vertices no two of which are adjacent, and a [[vertex cover]] is a set of vertices that includes at least one endpoint of each edge in the graph. The [[vertex space]] of a graph is a vector space having a set of basis vectors corresponding with the graph's vertices.
A cut vertex is a vertex the removal of which would disconnect the remaining graph; a vertex separator is a collection of vertices the removal of which would disconnect the remaining graph into small pieces. A k-vertex-connected graph is a graph in which removing fewer than k vertices always leaves the remaining graph connected. An independent set is a set of vertices no two of which are adjacent, and a vertex cover is a set of vertices that includes at least one endpoint of each edge in the graph. The vertex space of a graph is a vector space having a set of basis vectors corresponding with the graph's vertices.
割点是一个顶点，如果去掉这个顶点，就会断开剩余图的连接; 顶点分隔符是一组顶点的集合，如果去掉这些顶点，就会断开剩余图的连接。一个 k- 顶点连通图是这样一个图: 去掉少于 k 个顶点后，剩下的图仍然是连通的。一个独立的集合是一组顶点，没有两个是相邻的，顶点覆盖是一组顶点，包括图中每条边的至少一个端点。图的顶点空间是一个向量空间，它有一组与图的顶点相对应的基向量。
A graph is [[vertex-transitive graph|vertex-transitive]] if it has symmetries that map any vertex to any other vertex. In the context of [[graph enumeration]] and [[graph isomorphism]] it is important to distinguish between '''labeled vertices''' and '''unlabeled vertices'''. A labeled vertex is a vertex that is associated with extra information that enables it to be distinguished from other labeled vertices; two graphs can be considered isomorphic only if the correspondence between their vertices pairs up vertices with equal labels. An unlabeled vertex is one that can be substituted for any other vertex based only on its [[Adjacency (graph theory)|adjacencies]] in the graph and not based on any additional information.
A graph is vertex-transitive if it has symmetries that map any vertex to any other vertex. In the context of graph enumeration and graph isomorphism it is important to distinguish between labeled vertices and unlabeled vertices. A labeled vertex is a vertex that is associated with extra information that enables it to be distinguished from other labeled vertices; two graphs can be considered isomorphic only if the correspondence between their vertices pairs up vertices with equal labels. An unlabeled vertex is one that can be substituted for any other vertex based only on its adjacencies in the graph and not based on any additional information.
如果一个图具有将任何顶点映射到任何其他顶点的对称性，则该图是顶点传递的。在图计数和图同构的背景下，区分标记顶点和非标记顶点非常重要。标记顶点是与额外信息相关联的顶点，这些额外信息使得标记顶点能够与其他标记顶点区分开来; 只有当两个顶点之间的对应关系对应于具有相同标记的顶点时，两个图才可以被认为是同构的。一个未标记的顶点是一个可以替换的任何其他顶点只基于其邻接在图中，并没有任何额外的信息。
Vertices in graphs are analogous to, but not the same as, [[vertex (geometry)|vertices of polyhedra]]: the [[skeleton (topology)|skeleton]] of a polyhedron forms a graph, the vertices of which are the vertices of the polyhedron, but polyhedron vertices have additional structure (their geometric location) that is not assumed to be present in graph theory. The [[vertex figure]] of a vertex in a polyhedron is analogous to the neighborhood of a vertex in a graph.
Vertices in graphs are analogous to, but not the same as, vertices of polyhedra: the skeleton of a polyhedron forms a graph, the vertices of which are the vertices of the polyhedron, but polyhedron vertices have additional structure (their geometric location) that is not assumed to be present in graph theory. The vertex figure of a vertex in a polyhedron is analogous to the neighborhood of a vertex in a graph.
图中的顶点类似于多面体的顶点，但不同于多面体的顶点: 多面体的骨架构成一个图，其顶点是多面体的顶点，但多面体的顶点有附加的结构(几何位置) ，这在图论中是不存在的。多面体中顶点的顶点图形类似于图中顶点的邻域。
==See also==
* [[Node (computer science)]]
* [[Graph theory]]
* [[Glossary of graph theory]]
==References==
{{reflist}}
* {{cite journal
| last = Gallo
| last = Gallo
| last = Gallo
| first = Giorgio
| first = Giorgio
| first = Giorgio
| last2 = Pallotino
| last2 = Pallotino
2 = Pallotino
| first2 = Stefano
| first2 = Stefano
2 = Stefano
| title = Shortest path algorithms
| title = Shortest path algorithms
最短路径算法
| journal = Annals of Operations Research
| journal = Annals of Operations Research
运筹学年报
| volume = 13
| volume = 13
13
| issue = 1
| issue = 1
1
| pages = 1–79 <!-- the inline reference refers to page 4 -->
| pages = 1–79 <!-- the inline reference refers to page 4 -->
| pages = 1-79 < ! ! ——内联引用引用第4页 -- >
| year = 1988
| year = 1988
1988年
| doi = 10.1007/BF02288320
| doi = 10.1007/BF02288320
| doi = 10.1007/BF02288320
| ref=harv
| ref=harv
= harv
}}
}}
}}
* [[Claude Berge|Berge, Claude]], ''Théorie des graphes et ses applications''. Collection Universitaire de Mathématiques, II Dunod, Paris 1958, viii+277 pp. (English edition, Wiley 1961; Methuen & Co, New York 1962; Russian, Moscow 1961; Spanish, Mexico 1962; Roumanian, Bucharest 1969; Chinese, Shanghai 1963; Second printing of the 1962 first English edition. Dover, New York 2001)
* {{Cite book | last=Chartrand | first=Gary | authorlink=Gary Chartrand | title=Introductory graph theory | date=1985 | publisher=Dover | location=New York | isbn=0-486-24775-9 | pages= | url-access=registration | url=https://archive.org/details/introductorygrap0000char }}
* {{Cite book |author1=Biggs, Norman |author2=Lloyd, E. H. |author3=Wilson, Robin J. | title=Graph theory, 1736-1936 | date=1986 | publisher=Clarendon Press | location=Oxford [Oxfordshire] | isbn=0-19-853916-9 | pages=|title-link=Graph Theory, 1736–1936}}
* {{Cite book | last=Harary | first=Frank | authorlink=Frank Harary | title=Graph theory | date=1969 | publisher=Addison-Wesley Publishing | location=Reading, Mass. | isbn=0-201-41033-8 | pages=}}
* {{Cite book |author1=Harary, Frank |author2=Palmer, Edgar M. | title=Graphical enumeration | date=1973 | publisher=New York, Academic Press | location= | isbn=0-12-324245-2 | pages=}}
==External links==
*{{mathworld | title = Graph Vertex | urlname = GraphVertex}}
{{DEFAULTSORT:Vertex (Graph Theory)}}
[[Category:Graph theory]]
Category:Graph theory
范畴: 图论
<noinclude>
<small>This page was moved from [[wikipedia:en:Vertex (graph theory)]]. Its edit history can be viewed at [[顶点/edithistory]]</small></noinclude>
[[Category:待整理页面]]