Degree (graph theory)¶

The number of edge ends incident to a vertex, with loops counted twice in an undirected multigraph and distinct in-degree and out-degree counts for directed graphs.

Version: v2 · 2026-09-19 · History
Domain-specific #: 4087
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomains: Graph Theory, Vertex Invariants → Mathematics

Core Idea¶

The degree of a vertex is the cardinality of its incident edge-end multiset under the graph's loop and direction conventions. Counting incidence locally summarizes connectivity; summing degrees counts every undirected edge twice and supports global constraints such as the handshaking lemma. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

The load-bearing residual is not the broad topic of graph theory. It is local incidence count and its relation to graph-wide structure. That residual remains recognizable when examples, notation, scale, or implementation change, but it disappears if the carrier is mistyped, the condition that the graph type and loop convention are fixed and every eligible incident edge end is counted exactly once for the relevant degree fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test.

How would you explain it like I'm…

Count the Touching Lines

Draw some dots and connect them with lines. Pick one dot and count how many line ends touch it. That number is the dot's degree. A line that loops from a dot back to itself touches it twice, so it counts two.

How Many Edges Meet Here

In a graph, which is a set of dots joined by lines, the degree of a dot is the number of line-ends touching it. If you add up the degrees of all the dots, you always get twice the number of lines, because every line has two ends. That is why the total is always even. You also need to agree on the rules first, such as how to count a line that loops from a dot back to itself, or lines with arrows.

Vertex Incidence Count

The degree of a vertex counts the edge ends that touch it. Normally that is just the number of edges meeting the vertex, but you have to fix the rules first: a loop, an edge from a vertex back to itself, usually counts twice because both of its ends touch that vertex. In a directed graph, where edges have arrows, you count in-degree (arrows coming in) and out-degree (arrows going out) separately. Adding all degrees counts every undirected edge exactly twice, which gives the handshaking lemma: the sum of degrees equals twice the number of edges. So a local count at each vertex tells you something about the whole graph, such as the fact that the number of odd-degree vertices is always even.

The degree of a vertex is the number of edge-ends incident to it, that is, the cardinality of its incident edge-end multiset under the graph's conventions. Those conventions must be fixed first: whether the graph is simple, a multigraph or allows loops (a loop conventionally contributes 2 in the undirected case), and whether edges are directed, in which case in-degree and out-degree are counted separately. Each eligible edge-end must be counted exactly once for the relevant degree. Summing degrees over all vertices counts every undirected edge twice, giving the handshaking lemma Σ deg(v) = 2|E|, and therefore the number of odd-degree vertices is even; in directed graphs the in-degrees and out-degrees each sum to |E|. Degree is thus a local incidence count that supports global constraints, and it underlies further notions such as degree sequences, regularity, and minimum and maximum degree.

Scope of Application¶

Degree (graph theory) belongs to graph theory and is useful where the analyst can specify a graph or multigraph, a vertex, incident edge ends, loops and multiplicity, orientation conventions, and degree sequences or extrema, then evaluate the graph type and loop convention are fixed and every eligible incident edge end is counted exactly once for the relevant degree. The scope is broad within that domain but bounded by the need for the graph type and loop convention are fixed and every eligible incident edge end is counted exactly once for the relevant degree. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the graph type and loop convention are fixed and every eligible incident edge end is counted exactly once for the relevant degree the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Degree (graph theory) can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Degree (graph theory). Degree (graph theory) compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: a graph or multigraph, a vertex, incident edge ends, loops and multiplicity, orientation conventions, and degree sequences or extrema. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express the graph type and loop convention are fixed and every eligible incident edge end is counted exactly once for the relevant degree independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of graph theory because they reuse a graph or multigraph, a vertex, incident edge ends, loops and multiplicity, orientation conventions, and degree sequences or extrema, Counting incidence locally summarizes connectivity; summing degrees counts every undirected edge twice and supports global constraints such as the handshaking lemma., and type the carrier, state every parameter and convention in the definition, test that the graph type and loop convention are fixed and every eligible incident edge end is counted exactly once for the relevant degree, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Degree (graph theory) Domain-specific

Parents (1) — outgoing typed relations

Degree (graph theory) is a kind of Measurement Prime

Degree assigns a local connectivity magnitude to a vertex.

Hierarchy path (1) — routes to 1 parentless root

Degree (graph theory) → is a kind of Measurement

Neighborhood in Abstraction Space¶

Degree (graph theory) sits in a crowded region of the domain-specific corpus (2^nd percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Graph Classes & Invariants (40 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25