Graph Degree Calculator
Calculate vertex degrees, degree sequence, and analyze graph properties like connectivity and Eulerian paths.
Graph Input
Add Edge
Edges (6)
(0, 1) ×(0, 2) ×(1, 2) ×(1, 3) ×(2, 3) ×(3, 4) ×
Degree Sequence
[3, 3, 3, 2, 1]
Min Degree
1
Max Degree
3
Avg Degree
2.40
Vertex Degrees
v0
2
v1
3
v2
3
v3
3
v4
1
Graph Properties
Connected: Yes
Regular: No
Eulerian Circuit: No
Eulerian Path: No
Tree: No
Complete: No
Handshaking Lemma
Σdeg(v) = 12 = 2 × 6 = 2|E|
Graph Theory Concepts
Degree
The degree of a vertex is the number of edges incident to it.
Eulerian Conditions
- Circuit: all vertices have even degree
- Path: exactly 0 or 2 vertices have odd degree