A graph with vertices labeled by degree

In graph theory, the degree (or valency) of a vertex of a graph is the number of edges incident to the vertex.[1] The degree of a vertex v is denoted deg(v). The maximum degree of a graph G, denoted by Δ(G), is the maximum degree of its vertices, and the minimum degree of a graph, denoted by δ(G), is the minimum degree of its vertices. In the graph on the right, the maximum degree is 3 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.

The definition means that each loop is counted twice towards a vertex degree, because each edge has two endpoints and each endpoint adds to the degree.

Contents

Handshaking Theorem

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

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

Its proof is an example of the double counting approach: the number of edge-vertex incidences in a graph may be counted both as by summing over vertices on the left hand side of the formula, and by summing over edges on the right hand side.

The formula implies that in any graph, the number of vertices with odd degree is even. This statement (as well as the degree sum formula) is known as the Handshaking Theorem. 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.

Degree sequence

The degree sequence of an undirected graph is the non-increasing sequence of its vertex degrees;[2] for the above graph it is (3, 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; non-isomorphic graphs may have the same degree sequence.

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. (the trailing zeroes may be ignored since they are trivially realized by adding an appropriate number of isolated vertices to the graph.

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

As a consequence of the degree sum formula, any sequence with an odd sum, such as (3, 3, 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 graph. The construction of such a graph is simple: connect odd vertices in pairs, and fill with self-loops.

Often one wishes to search for simple graphs, making the degree sequence problem more challenging. Obviously the sequence (8, 4) is not the degree sequence of a simple graph, since we would have the contradiction Δ(G) > (the number of vertices - 1). The sequence (3, 3, 3, 1) is also not the degree sequence of a simple graph, but in this case the reason is less obvious. Finding general criteria for degree sequences of simple graphs is a classical problem; solutions have been offered by Erdős and Gallai (1960), Havel (1955) and Hakimi (1961), Choudum and Sierksma et al. (1991).

For example, the Erdős-Gallai theorem states that the sequence (di)i=1,...,n is a degree sequence of a simple graph iff the sum of the sequence is even and \sum_{i=1}^{k}d_i \leq k(k-1) + \sum_{i=k+1}^n \mathrm{min}(d_i,k) for all k between 1 and n. Havel and Hakimi proved that (d1,d2,...,dn) is a degree sequence of a simple graph iff (d2-1,d3-1,...,dd1+1-1,dd1+2, dd1+3,...,dn) is.

Special values

An undirected graph with leaf nodes 4, 5, 6, 7, 10, 11, and 12
  • A vertex with degree 0 is called an isolated vertex.
  • A vertex with degree 1 is called a leaf vertex and the edge connected to 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 trees in graph theory and especially trees as data structures.

Global properties

  • If each vertex of the graph has the same degree k the graph is called a k-regular graph and the graph itself is said to have degree k.
  • An undirected, connected graph has an Eulerian path if and only if it has either either 0 or 2 vertices of odd degree. If it has 0 vertices of odd degree, the Eulerian path is an Eulerian circuit.
  • A directed graph is a pseudoforest if and only if every vertex has outdegree at most 1. A functional graph is a special case of a pseudoforest in which every vertex has outdegree exactly 1.

See also

References

  1. ^ Diestel p.5
  2. ^ Diestel p.278
Retrieved from "http://en.wikipedia.org/wiki/Degree_(graph_theory)"

No comments have been added.



Your name:

City:

Country:

Your comments:

Security check *
(Please enter the number into adjoining box)