Degree (graph theory)

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

An undirected graph with leaf nodes 4, 5, 6, 7, 10, 11, and 12

In graph theory, the degree (or valency) of a vertex of a graph is the number of edges incident to the vertex, with loops counted twice. The degree of a vertex $v$ is denoted $\deg(v)$ or $\deg v$ . The maximum degree of a graph G, denoted by Δ(G), and the minimum degree of a graph, denoted by δ(G), are the maximum and minimum degree of its vertices. In the graph on the right, the maximum degree is 5 and the minimum degree is 0. In a regular graph, all degrees are the same, and so we can speak of the degree of the graph.

单词	Graphic sequence
释义	Graphic sequence 英语百科 Degree (graph theory) In graph theory, the degree (or valency) of a vertex of a graph is the number of edges incident to the vertex, with loops counted twice. The degree of a vertex $v$ is denoted $\deg(v)$ or $\deg v$ . The maximum degree of a graph G, denoted by Δ(G), and the minimum degree of a graph, denoted by δ(G), are the maximum and minimum degree of its vertices. In the graph on the right, the maximum degree is 5 and the minimum degree is 0. In a regular graph, all degrees are the same, and so we can speak of the degree of the graph.
随便看	nullize nullizygosity nullizygote nullizygous null junction null key null layer null lens Null line null line suppression null link null lint null list null locator null locator value null loctator value null loop Null lymphocyte Null Lymphocytes null manifold Null matrix null measurement null measurement method null measurement of transconductance null meter

Graphic sequence

Degree (graph theory)