Out-degree

Out-degree is the number of edges that leave a vertex in a directed graph. In Combinatorics, you use it to describe how many directed connections start at a node.

What is the out-degree?

Out-degree is the count of edges pointing away from a vertex in a directed graph. If a vertex has three arrows leaving it, its out-degree is 3. If no edges leave it, the out-degree is 0.

The direction matters. In an undirected graph, edges do not have arrows, so the idea of out-degree does not apply. Once you add direction, every edge has a start and an end, and out-degree counts only the edges where your vertex is the starting point.

A good way to picture it is with a social media network. If person A follows five other accounts, then A’s out-degree is 5, because those are five outgoing connections from A. Another person might have many followers but follow no one back, so their out-degree could be low even if their in-degree is high.

That difference between out-degree and in-degree is one of the main reasons directed graphs are useful. They let you describe one-way relationships, like links on a website, emails sent from one address to another, or roads with one-way traffic. Out-degree tells you how much a vertex sends out, while in-degree tells you how much it receives.

You can also use out-degree to describe an entire graph. In a directed graph, the sum of all vertices’ out-degrees equals the total number of directed edges, because every edge leaves exactly one vertex. That is a direct counting idea, not a coincidence. It connects out-degree to degree sequences and to the Handshaking Lemma style of reasoning used in graph theory.

A common mistake is to count both ends of a directed edge for out-degree. You do not. Only the tail of the arrow counts. If a vertex has a loop, some courses count that loop as contributing to both in-degree and out-degree, so check the graph conventions being used in class.

Why the out-degree matters in COMBINATORICS

Out-degree gives you a quick way to measure how a vertex behaves in a directed network. In Combinatorics, that matters because many problems are not just about whether two objects are connected, but about the direction of the connection and how many choices or actions leave each point.

It shows up whenever you are building or reading a directed graph from a situation. If a problem describes who sends messages to whom, which webpages link to which other pages, or which roads go one way, out-degree helps you translate the story into graph language. Once you can do that, you can count edges, compare vertices, and spot patterns in the structure.

Out-degree also connects directly to degree sequences. If you are given a list of out-degrees, you may be asked whether it could come from a directed graph or how many edges the graph must have. Since the total out-degree equals the number of directed edges, it gives you a fast check on your work.

This term also sets up bigger ideas in graph theory, especially the difference between outgoing and incoming behavior. That difference matters in network models, flow problems, and any question where direction changes the meaning of the connection.

How the out-degree connects across the course

in-degree

In-degree counts the edges that enter a vertex, while out-degree counts the edges that leave it. In directed graphs, you usually need both numbers to describe a vertex completely. A node can have high out-degree and low in-degree, or the reverse, and that difference changes how you interpret the network.

directed graph

Out-degree only makes sense in a directed graph, because direction is what creates a distinction between incoming and outgoing edges. If a graph has arrows, each edge contributes to the out-degree of its starting vertex. Without arrows, every edge is just a connection, so there is no out-degree to count.

degree sequence

A degree sequence is a list of vertex degrees, and in directed graphs you may track out-degrees separately from in-degrees. That lets you summarize a graph without drawing every edge. If the problem gives a sequence of out-degrees, you can use it to check whether the graph structure is possible and how many directed edges are present.

multigraph

In a multigraph, multiple edges can connect the same pair of vertices, so out-degree can be larger than you might expect from the number of neighboring vertices alone. You count each outgoing edge separately. That means a single vertex could have several arrows leaving it to the same destination and still have a bigger out-degree.

Is the out-degree on the COMBINATORICS exam?

A graph theory problem may give you a directed diagram and ask for the out-degree of one vertex, the out-degree sequence of the whole graph, or the total number of edges. Your move is to count only the arrows leaving each vertex, not the ones entering it. If the graph is part of a counting or proof question, you may also use the fact that the sum of all out-degrees equals the number of directed edges.

When a problem includes a network story, translate the story into arrows first. Then check whether each edge starts at the vertex you are counting. This is especially useful when the graph looks busy, because the most common error is mixing up in-degree and out-degree or double-counting an edge.

The out-degree vs in-degree

Out-degree counts edges leaving a vertex, while in-degree counts edges entering it. They are easy to mix up because both use the same directed graph, but the arrow direction changes the count. If you trace the tail of each arrow, you are finding out-degree; if you trace the head, you are finding in-degree.

Key things to remember about the out-degree

• Out-degree is the number of directed edges that leave a vertex.

• It only applies to directed graphs, because undirected graphs do not have arrow direction.

• In a directed graph, the sum of all out-degrees equals the total number of edges.

• Out-degree and in-degree measure different parts of the same network, so do not swap them.

• When you see a graph problem, count the tails of arrows, not the heads.

Frequently asked questions about the out-degree

What is out-degree in Combinatorics?

Out-degree is the number of edges leaving a vertex in a directed graph. It tells you how many outgoing connections a node has. In Combinatorics, you use it when reading network diagrams, degree sequences, and counting arguments involving directed edges.

What is the difference between out-degree and in-degree?

Out-degree counts edges that start at a vertex, while in-degree counts edges that end at that vertex. The two values can be very different in the same graph. If you are tracing arrows away from the vertex, you are working with out-degree.

How do you find the out-degree of a vertex?

Look at the vertex and count every directed edge that leaves it. Ignore edges that point into the vertex. If there are multiple arrows going to the same place, count each one separately.

Why does out-degree matter in graph theory problems?

Out-degree helps you describe how a directed graph sends flow, links, or connections from one vertex to another. It also connects to degree sequences and edge counting, so it often appears in short-answer problems and proof-style questions.