In graph theory, the degree 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 is denoted or. The maximum degree of a graph, denoted by, and the minimum degree of a graph, denoted by, 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 a regular graph, every vertex has the same degree, and so we can speak of the degree of the graph. A complete graph is a special kind of regular graph where all vertices have the maximum degree,.
The degree sequence of an undirected graph is the non-increasing sequence of its vertex degrees; for the above graph it is. 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 problem is the problem of finding some or all graphs with the degree sequence being a given non-increasing sequence of positive integers. 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, 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 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 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 -graphic if it is the degree sequence of some -uniform hypergraph. In particular, a -graphic sequence is graphic. Deciding if a given sequence is -graphic is doable in polynomial time for via the Erdős–Gallai theorem but is NP-complete for all .
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, is a pendant edge. This terminology is common in the study of trees in graph theory and especially trees as data structures.
A vertex with degree n − 1 in a graph on n vertices is called a dominating vertex.
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. 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.
