Average Degree: How to Calculate It
Use this interactive graph theory calculator to find the average degree of a network from vertices and edges, compare undirected and directed graphs, and visualize how total degree relates to graph size.
Average Degree Calculator
Formula reminder: for an undirected graph, average degree = 2E / V. For a directed graph, average in-degree = average out-degree = E / V, while average total degree = 2E / V.
Enter your graph values and click the button to see the average degree, total degree, and a quick interpretation.
Graph Snapshot
Visual comparison of vertices, edges, total degree, and average degree.
What does average degree mean?
In graph theory, the degree of a vertex tells you how many connections touch that vertex. The average degree is simply the mean number of connections per vertex across the entire graph. If you are studying networks, transportation systems, social graphs, computer science structures, or mathematical models, average degree is one of the fastest ways to summarize how connected the graph is.
When people search for “average degree how to calculate,” they are usually trying to answer one of three questions: how to compute it from the number of vertices and edges, how to verify it from the sum of all vertex degrees, or how the formula changes for directed graphs. The key idea is that average degree is not guessed from one vertex. It is computed from the whole graph.
Average degree formula
For an undirected graph
If a graph has V vertices and E edges, then:
Average degree = 2E / V
This works because each undirected edge touches two endpoints, so every edge contributes 2 to the total degree count.
For a directed graph
In a directed graph, each edge contributes 1 to an out-degree and 1 to an in-degree. That means:
- Average in-degree = E / V
- Average out-degree = E / V
- Average total degree = 2E / V
So if your course, textbook, or problem says “average degree” in a directed graph, check whether it means average in-degree, average out-degree, or the combined total degree. In many contexts, instructors specify this clearly.
How to calculate average degree step by step
- Count the number of vertices in the graph.
- Count the number of edges.
- Decide whether the graph is undirected or directed.
- Apply the correct formula.
- Round your answer to the requested number of decimal places.
Example 1: Undirected graph
Suppose a graph has 12 vertices and 18 edges. Use the undirected formula:
Average degree = 2 × 18 / 12 = 36 / 12 = 3
So the average vertex in this graph has 3 incident edges.
Example 2: Directed graph
Suppose a directed network has 20 vertices and 50 edges.
- Average in-degree = 50 / 20 = 2.5
- Average out-degree = 50 / 20 = 2.5
- Average total degree = 2 × 50 / 20 = 5
That tells you the typical node sends 2.5 links and receives 2.5 links on average.
Example 3: Using total degree sum
If you already know the sum of all degrees, then average degree is even easier:
Average degree = Total degree sum / Number of vertices
For instance, if the total degree sum is 84 and there are 21 vertices, the average degree is 84 / 21 = 4.
Why the formula uses 2E in undirected graphs
This is one of the most common points of confusion. Students often ask why you multiply the number of edges by 2. The answer is simple: every undirected edge has two ends. If one edge connects vertex A and vertex B, then it contributes 1 to the degree of A and 1 to the degree of B. That means the total degree count grows by 2 for every edge.
As a result, the total degree sum of an undirected graph is always even. This fact is not just a computational shortcut. It is a foundational result in graph theory and often appears in proofs, exam questions, and algorithm analysis.
Comparison table: formulas by graph type
| Graph type | Known values | Average degree formula | Interpretation |
|---|---|---|---|
| Undirected | Vertices V, edges E | 2E / V | Average number of incident edges per vertex |
| Directed | Vertices V, edges E | E / V for in-degree; E / V for out-degree | Average incoming or outgoing links per vertex |
| Directed | Vertices V, edges E | 2E / V for total degree | Average combined in-degree plus out-degree |
| Any graph | Vertices V, total degree sum S | S / V | Useful when degree counts are already listed |
Real-world network statistics and context
Average degree matters because it compresses a large network into one interpretable measure. In social science, it can describe how connected a typical person is. In web graphs, it can estimate how many links a typical page has. In transportation or utility networks, it can indicate how many routes or lines meet at an average node.
Researchers and public institutions regularly analyze connected systems at scale. For example, the mathematics of networks is taught and discussed by major educational institutions, while public agencies use graph-like infrastructure models in planning, logistics, and public health. If you want a rigorous academic foundation, see educational resources from MathWorld, course materials from universities, and federal data publications where network methods appear in applied settings.
Reference statistics table
| Scenario | Vertices | Edges | Computed average degree | Meaning |
|---|---|---|---|---|
| Small classroom friendship graph | 30 | 45 | 3.0 | Each student is connected to 3 classmates on average |
| City intersection network | 1,000 | 1,400 | 2.8 | Typical intersection links to about 3 roads |
| Directed citation network | 5,000 | 20,000 | 4.0 in-degree, 4.0 out-degree, 8.0 total | Typical paper cites 4 others and is cited by 4 on average in this snapshot |
| Server connection map | 250 | 1,000 | 8.0 | Higher average degree suggests denser connectivity |
Common mistakes when calculating average degree
- Forgetting to multiply edges by 2 in undirected graphs.
- Mixing up directed and undirected formulas.
- Using the wrong number of vertices, especially if isolated vertices exist.
- Confusing average degree with density. A graph can have the same average degree as another graph but a different overall density depending on size.
- Ignoring whether loops are allowed. In some conventions, a loop contributes 2 to the degree in an undirected graph.
Average degree vs density
Average degree and density are related, but they are not the same thing. Average degree tells you the typical number of connections per vertex. Density tells you how full the graph is compared with the maximum possible number of edges.
For an undirected simple graph with V vertices, the maximum possible number of edges is V(V-1)/2. Density is therefore:
Density = 2E / [V(V-1)]
Notice that average degree uses 2E/V, while density divides by the maximum possible connection count. As graphs grow larger, average degree can stay stable even while density becomes very small. That is common in real-world sparse networks.
How average degree behaves in special graphs
Complete graph
In a complete graph with V vertices, every vertex is connected to every other vertex. Each degree is V-1, so the average degree is also V-1. This is the densest possible simple undirected graph.
Path graph
A path graph with V vertices has two endpoints of degree 1 and the remaining V-2 vertices of degree 2. The average degree approaches 2 as the path gets longer, but it is slightly below 2 for finite graphs.
Cycle graph
Every vertex has degree 2, so the average degree is exactly 2.
Star graph
One center has high degree and all leaves have degree 1. The average degree is still easy to compute using 2E/V, showing how average degree can hide uneven degree distribution. That is why analysts often examine both average degree and degree variance.
How to verify your answer manually
If your graph is small enough to inspect, list the degree of every vertex and add them together. Then divide by the number of vertices. Your answer should match the formula-based result. This is a useful check on homework and exams.
- Write every vertex degree in a list.
- Add all degrees to get the total degree sum.
- Divide by the number of vertices.
- Compare with 2E / V if the graph is undirected.
For example, if the degrees are 1, 2, 2, 3, 4, and 4, the total is 16. With 6 vertices, average degree = 16 / 6 = 2.67. If the graph is undirected, then the number of edges must be 8 because 2E = 16.
Practical uses in data science, computer science, and engineering
Average degree appears in many technical disciplines. In computer networks, it helps estimate redundancy and communication load. In epidemiology, higher average degree can imply faster spread through contact networks. In recommendation systems, it can summarize interaction structure between users and items. In graph algorithms, average degree often affects memory usage and runtime behavior, especially when distinguishing sparse and dense graphs.
If you want additional authoritative reading, consider these public educational and government resources:
- Cornell University graph theory lecture notes
- National Institute of Standards and Technology
- U.S. Census Bureau
When average degree is not enough
Average degree is valuable, but it does not tell the whole story. Two graphs can share the same average degree while having very different structures. One graph may be balanced, where nearly every vertex has similar degree. Another may have many low-degree vertices and a few hubs. In network science, that difference can matter more than the average itself.
That is why analysts often pair average degree with:
- Degree distribution
- Median degree
- Maximum degree
- Clustering coefficient
- Density
- Connected components
Final takeaway
If you need a quick answer to “average degree how to calculate,” remember this: count vertices, count edges, and use the right formula for the graph type. For undirected graphs, average degree is 2E / V. For directed graphs, average in-degree and average out-degree are each E / V, and average total degree is 2E / V. If the sum of all degrees is already known, divide that sum by the number of vertices.
Use the calculator above to get instant results and a chart-based visual summary. It is especially useful for homework checks, lecture examples, and network analysis practice.