更改

In graph theory, the degree (or valency) of a vertex of a graph is the number of edges that are incident to the vertex, and in a multigraph, loops are counted twice. The degree of a vertex <math>v</math> is denoted <math>\deg(v)</math> or <math>\deg v</math>. The maximum degree of a graph <math>G</math>, denoted by <math>\Delta(G)</math>, and the minimum degree of a graph, denoted by <math>\delta(G)</math>, are the maximum and minimum degree of its vertices. In the multigraph on the right, the maximum degree is 5 and the minimum degree is 0.

In graph theory, the degree (or valency) of a vertex of a graph is the number of edges that are incident to the vertex, and in a multigraph, loops are counted twice. The degree of a vertex <math>v</math> is denoted <math>\deg(v)</math> or <math>\deg v</math>. The maximum degree of a graph <math>G</math>, denoted by <math>\Delta(G)</math>, and the minimum degree of a graph, denoted by <math>\delta(G)</math>, are the maximum and minimum degree of its vertices. In the multigraph on the right, the maximum degree is 5 and the minimum degree is 0.

在图论中，图中顶点的度(或价)是入射到该顶点的边的数量。在多重图中，自环会被计算两次。顶点的度数可表示为<math>\deg(v)</math>或<math>\deg v</math>。一个图<math>G</math>的最大度值表示为 < math > Delta (g) </math > ，最小度值表示为 <math>\delta(G)</math>。在右侧的多重图中，最大度值为5，最小度值为0。

在'''<font color="#ff8000">图论 Graph Theory</font>'''中，图中顶点的'''<font color="#ff8000">度 Degree</font>'''(或价)是入射到该顶点的边的数量。在'''<font color="#ff8000">多重图 Multigraph</font>'''中，'''<font color="#ff8000">自环 Loops</font>'''会被计算两次。顶点的度数可表示为<math>\deg(v)</math>或<math>\deg v</math>。一个图<math>G</math>的最大度值表示为<math>\Delta(G)</math>，最小度值表示为 <math>\delta(G)</math>。在右侧的多重图中，最大度值为5，最小度值为0。

In a regular graph, every vertex has the same degree, and so we can speak of the degree of the graph. A complete graph (denoted <math>K_n</math>, where <math>n</math> is the number of vertices in the graph) is a special kind of regular graph where all vertices have the maximum degree, <math>n-1</math>.

In a regular graph, every vertex has the same degree, and so we can speak of the degree of the graph. A complete graph (denoted <math>K_n</math>, where <math>n</math> is the number of vertices in the graph) is a special kind of regular graph where all vertices have the maximum degree, <math>n-1</math>.

在正则图中，每个顶点都具有相同的度值，因此我们可以称之为该图的度值。一个完全图(表示为<math>K_n</math>，其中<math>n</math>是图中顶点的数目)是一种特殊的正则图，其中所有顶点都有最大度值，<math>n-1</math>。

在'''<font color="#ff8000">正则图 Regular Graph</font>'''中，每个顶点都具有相同的度值，因此我们把该度值可以称之为图的度值。一个'''<font color="#ff8000">完全图 Complete Graph</font>'''(表示为<math>K_n</math>，其中<math>n</math>是图中顶点的数目)是一种特殊的正则图，其中所有顶点都有最大度值，<math>n-1</math>。

The degree sum formula states that, given a graph <math>G=(V, E)</math>,

The degree sum formula states that, given a graph <math>G=(V, E)</math>,

度和公式表明，给定一个图<math>G=(V, E)</math>,

'''<font color="#ff8000">度和公式 Degree Sum Formula</font>'''表明，给定一个图<math>G=(V, E)</math>,

<math>\sum_{v \in V} \deg(v) = 2|E|\, .</math>

<math>\sum_{v \in V} \deg(v) = 2|E|\, .</math>

The formula implies that in any undirected graph, the number of vertices with odd degree is even. This statement (as well as the degree sum formula) is known as the handshaking lemma. The latter name comes from a popular mathematical problem, to prove that in any group of people the number of people who have shaken hands with an odd number of other people from the group is even.

The formula implies that in any undirected graph, the number of vertices with odd degree is even. This statement (as well as the degree sum formula) is known as the handshaking lemma. The latter name comes from a popular mathematical problem, to prove that in any group of people the number of people who have shaken hands with an odd number of other people from the group is even.

该公式表明，在任何无向图中，拥有奇数度值的顶点的个数是偶数。这个陈述(以及度和公式)被称为握手引理。该名字来自一个著名的数学问题，即证明无论该群体内有多少人，与奇数人握过手的人数是偶数。

该公式表明，在任何无向图中，拥有奇数度值的顶点的个数是偶数。这个陈述(以及度和公式)被称为握手引理。该名字来自一个有趣的数学问题，即证明无论该群体内有多少人，与奇数个人握过手的人数是偶数。

度序列

度序列

[[File:Conjugate-dessins.svg|thumb|200px|

[[File:Conjugate-dessins.svg|thumb|200px|

图2：Two non-isomorphic graphs with the same degree sequence (3, 2, 2, 2, 2, 1, 1, 1).]]

图2：Two non-isomorphic graphs with the same degree sequence (3, 2, 2, 2, 2, 1, 1, 1).

两个具有相同度序列的非同构图]]

The degree sequence of an undirected graph is the non-increasing sequence of its vertex degrees; for the above graph it is (5, 3, 3, 2, 2, 1, 0). The degree sequence is a graph invariant so isomorphic graphs have the same degree sequence. However, the degree sequence does not, in general, uniquely identify a graph; in some cases, non-isomorphic graphs have the same degree sequence.

The degree sequence of an undirected graph is the non-increasing sequence of its vertex degrees; for the above graph it is (5, 3, 3, 2, 2, 1, 0). The degree sequence is a graph invariant so isomorphic graphs have the same degree sequence. However, the degree sequence does not, in general, uniquely identify a graph; in some cases, non-isomorphic graphs have the same degree sequence.

无向图的度序列是指将其各顶点度值按非递增方式排序，对于上述图是(5,3,3,2,2,1,0)。度序列是图的不变量，因此同构图（两个图中顶点的度值都相同，但形状不同）具有相同的度序列。然而，度序列通常不能唯一地标识一个图，在某些情况下，非同构图具有相同的度序列。

无向图的度序列是指将其各顶点度值按非递增方式排序，对于上述图是(5,3,3,2,2,1,0)。度序列是'''<font color="#ff8000">图不变量 Graph Invariant</font>'''，因此'''<font color="#ff8000">同构图 Non-isomorphic Graphs</font>'''（两个图中顶点的度值都相同，但形状不同）具有相同的度序列。然而，度序列通常不能唯一地标识一个图，在某些情况下，非同构图具有相同的度序列。

The degree sequence problem  is the problem of finding some or all graphs with the degree sequence being a given non-increasing sequence of positive integers. (Trailing zeroes may be ignored since they are trivially realized by adding an appropriate number of isolated vertices to the graph.) A sequence which is the degree sequence of some graph, i.e. for which the degree sequence problem has a solution, is called a graphic or graphical sequence. As a consequence of the degree sum formula, any sequence with an odd sum, such as (3,&nbsp;3,&nbsp;1), cannot be realized as the degree sequence of a graph. The converse is also true: if a sequence has an even sum, it is the degree sequence of a multigraph. The construction of such a graph is straightforward: connect vertices with odd degrees in pairs by a matching, and fill out the remaining even degree counts by self-loops.

The degree sequence problem  is the problem of finding some or all graphs with the degree sequence being a given non-increasing sequence of positive integers. (Trailing zeroes may be ignored since they are trivially realized by adding an appropriate number of isolated vertices to the graph.) A sequence which is the degree sequence of some graph, i.e. for which the degree sequence problem has a solution, is called a graphic or graphical sequence. As a consequence of the degree sum formula, any sequence with an odd sum, such as (3,&nbsp;3,&nbsp;1), cannot be realized as the degree sequence of a graph. The converse is also true: if a sequence has an even sum, it is the degree sequence of a multigraph. The construction of such a graph is straightforward: connect vertices with odd degrees in pairs by a matching, and fill out the remaining even degree counts by self-loops.

度序列问题，是指寻找具有以非增方式排列给定正整数的度序列的局部或全部图的问题。(序列尾部的零可能会被忽略，因为通过向图中添加适当数量的孤立顶点就可以轻松实现序列尾部不断加零。)一个序列是某个图的度序列，即一个度序列问题有解时，该序列称为图形序列。由于度和公式的存在，任何具有奇数和的序列，如(3,3,1) ，都不会是图的度序列。反之亦然: 如果一个序列有偶数和，它就是重图的度序列。构造这样一个图是很简单: 通过匹配将奇数度值的顶点成对连接起来，然后剩余的偶数度值顶点都连出一条边指向自己。

'''<font color="#ff8000">度序列问题 Degree Sequence Problem</font>'''，是指寻找具有以非增方式排列给定正整数的度序列的局部或全部图的问题。(序列尾部的零可能会被忽略，因为通过向图中添加适当数量的孤立顶点就可以轻松实现序列尾部不断加零。)一个序列是某个图的度序列，即一个度序列问题有解时，该序列称为图形序列。由于度和公式的存在，任何具有奇数和的序列，如(3,3,1) ，都不会是图的度序列。反之亦然: 如果一个序列和是偶数，它就是重图的度序列。构造这样一个图是很简单: 匹配奇数度值的顶点并成对连接起来，然后剩余的偶数度值顶点都连出一条边指向自己。

The question of whether a given degree sequence can be realized by a [[simple graph]] is more challenging. This problem is also called [[graph realization problem]] and can either be solved by the [[Erdős–Gallai theorem]] or the [[Havel–Hakimi algorithm]].  

The question of whether a given degree sequence can be realized by a [[simple graph]] is more challenging. This problem is also called [[graph realization problem]] and can either be solved by the [[Erdős–Gallai theorem]] or the [[Havel–Hakimi algorithm]].  

The question of whether a given degree sequence can be realized by a simple graph is more challenging. This problem is also called graph realization problem and can either be solved by the Erdős–Gallai theorem or the Havel–Hakimi algorithm.  

The question of whether a given degree sequence can be realized by a simple graph is more challenging. This problem is also called graph realization problem and can either be solved by the Erdős–Gallai theorem or the Havel–Hakimi algorithm.  

一个给定的度序列是否可以用一个简单的图进行表示，是一个具有挑战性的问题。这个问题也称为图实现问题，可以用 Erdős–Gallai定理解决，也可以用Havel-Hakimi算法解决。

一个给定的度序列是否可以用一个简单的图进行表示，是一个具有挑战性的问题。这个问题也称为'''<font color="#ff8000">图实现 Graph Realization Problem</font>'''问题，可以用 Erdős–Gallai定理解决，也可以用Havel-Hakimi算法解决。

The problem of finding or estimating the  number of graphs with a given degree sequence is a problem from the field of [[graph enumeration]].

The problem of finding or estimating the  number of graphs with a given degree sequence is a problem from the field of [[graph enumeration]].

The problem of finding or estimating the  number of graphs with a given degree sequence is a problem from the field of graph enumeration.

The problem of finding or estimating the  number of graphs with a given degree sequence is a problem from the field of graph enumeration.

More generally, the degree sequence of a hypergraph is the non-increasing sequence of its vertex degrees. A sequence is <math>k</math>-graphic if it is the degree sequence of some <math>k</math>-uniform hypergraph. In particular, a <math>2</math>-graphic sequence is graphic. Deciding if a given sequence is <math>k</math>-graphic is doable in polynomial time for <math>k=2</math> via the Erdős–Gallai theorem but is NP-complete for all <math>k\ge 3</math> (Deza et al., 2018 ).

More generally, the degree sequence of a hypergraph is the non-increasing sequence of its vertex degrees. A sequence is <math>k</math>-graphic if it is the degree sequence of some <math>k</math>-uniform hypergraph. In particular, a <math>2</math>-graphic sequence is graphic. Deciding if a given sequence is <math>k</math>-graphic is doable in polynomial time for <math>k=2</math> via the Erdős–Gallai theorem but is NP-complete for all <math>k\ge 3</math> (Deza et al., 2018 ).

一般来说，超图的度序列是其顶点度的非递增序列。一个序列是<math>k</math>-graphic，如果它是一些<math>k</math>-uniform超图的度序列。特别是 < math > 2 </math >-graphic 序列是图形。决定一个给定的序列是否是 < math > k </math >-graphic 可以在 < math > k = 2 </math >的多项式时间内通过Erdős–Gallai定理实现，但是当<math>k\ge 3</math>时该问题转化为NP完全问题(Deza et al. ，2018)。

一般来说，'''<font color="#ff8000">超图 Hypergraph</font>'''的度序列是其顶点度的非递增序列。一个序列是<math>k-graphic</math>，如果它是一些<math>k-uniform</math>超图的度序列。特别是<math>2</math>-graphic序列是图形。决定一个给定的序列是否是<math>k</math>-graphic可以在 <math>k=2</math>的多项式时间内通过Erdős–Gallai定理实现，但是当<math>k\ge 3</math>时该问题可转化为'''<font color="#ff8000">NP完全问题 NP-complete</font>'''(Deza et al. ，2018)。

度值为0的顶点成为孤立顶点

度值为0的顶点成为孤立顶点

*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的顶点称为叶顶点或尾顶点，该顶点的入射边称为悬挂边。在右侧的图中，{3,5}就是一个悬挂边。在图论中，该术语主要在研究树时使用，特别是具有树形结构的数据。

度值为1的顶点称为叶顶点或尾顶点，该顶点的入射边称为悬挂边。在右侧的图中，{3,5}就是一个悬挂边。在图论中，该术语主要在研究“树”时使用，特别是具有树形结构的数据。

* 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的顶点叫作主导顶点

在有n个顶点的图中，度值为n-1的顶点叫作主导顶点

全局属性

全局属性

*If each vertex of the graph has the same degree&nbsp;''k'' the graph is called a [[regular graph|''k''-regular graph]] and the graph itself is said to have degree&nbsp;''k''. Similarly, a [[bipartite graph]] in which every two vertices on the same side of the bipartition as each other have the same degree is called a [[biregular graph]].

*If each vertex of the graph has the same degree&nbsp;''k'' the graph is called a [[regular graph|''k''-regular graph]] and the graph itself is said to have degree&nbsp;''k''. Similarly, a [[bipartite graph]] in which every two vertices on the same side of the bipartition as each other have the same degree is called a [[biregular graph]].

如果一个图中的所有顶点的度值都为k，该图被称为k-正则图，该图的度值也为k。相似的，同侧每两个顶点都具有相同度值的二分图叫作二分正则图。

如果一个图中的所有顶点的度值都为k，该图被称为k-正则图，该图的度值也为k。同样的，同侧每两个顶点都具有相同度值的二分图叫作二分正则图。

*An undirected, connected graph has an [[Eulerian path]] if and only if it has either 0 or 2 vertices of odd degree. If it has 0 vertices of odd degree, the Eulerian path is an Eulerian circuit.

*An undirected, connected graph has an [[Eulerian path]] if and only if it has either 0 or 2 vertices of odd degree. If it has 0 vertices of odd degree, the Eulerian path is an Eulerian circuit.

当且仅当具有0或2个奇数度的顶点时，无向连通图才具有欧拉路径。 如果它具有0个奇数度的顶点，则欧拉路径为欧拉回路。

当且仅当具有0或2个奇数度的顶点时，无向连通图才具有欧拉路径。 如果它具有0个奇数度的顶点，则欧拉路径为欧拉回路。

*A directed graph is a [[pseudoforest]] if and only if every vertex has outdegree at most&nbsp;1. A [[functional graph]] is a special case of a pseudoforest in which every vertex has outdegree exactly&nbsp;1.

*A directed graph is a [[pseudoforest]] if and only if every vertex has outdegree at most&nbsp;1. A [[functional graph]] is a special case of a pseudoforest in which every vertex has outdegree exactly&nbsp;1.

*By [[Brooks' theorem]], any graph other than a clique or an odd cycle has [[chromatic number]] at most&nbsp;Δ, and by [[Vizing's theorem]] any graph has [[chromatic index]] at most Δ&nbsp;+&nbsp;1.

*By [[Brooks' theorem]], any graph other than a clique or an odd cycle has [[chromatic number]] at most&nbsp;Δ, and by [[Vizing's theorem]] any graph has [[chromatic index]] at most Δ&nbsp;+&nbsp;1.

根据布鲁克斯定理，除团簇或奇数循环外，任何图的色度数最大为Δ，而根据维辛定理，任何图的色度指数最大为Δ+ 1。

根据布鲁克斯定理，除团簇或奇数循环外，任何图的色度数最大为Δ，而根据维辛定理，任何图的色度指数最大为Δ+ 1。

*A [[Degeneracy (graph theory)|''k''-degenerate graph]] is a graph in which each subgraph has a vertex of degree at most ''k''.

*A [[Degeneracy (graph theory)|''k''-degenerate graph]] is a graph in which each subgraph has a vertex of degree at most ''k''.