Graph Theory & Trees

Degree

The degree of a vertex is the number of edges incident to it in an undirected graph.

Meaning

What Is Degree?

The degree of a vertex is the number of edges incident to it in an undirected graph.

The degree of a vertex is the number of edges incident to it in an undirected graph.

Examples

Examples of Degree

1If v touches 3 edges, deg(v)=3.
Understand

Formula and Key Points

Formula / rule
deg(v)
  • Know the definition and standard notation for Degree.
  • Be able to recognise or compute degree in a small example.
  • Connect the concept to nearby topics in the same subject before using it in larger CSE problems.
CSE Connection

Why This Matters in Computer Science

Used in networks, routing, dependency graphs, compilers, social networks, file systems and graph algorithms.

FAQ

Degree: Frequently Asked Questions

What is Degree?

The degree of a vertex is the number of edges incident to it in an undirected graph.

Why is Degree useful in computer science?

Used in networks, routing, dependency graphs, compilers, social networks, file systems and graph algorithms.