Worked solution: graph with edges AB, BC, CD, DA, AC
Step-by-step working for this graph theory problem, produced and checked by the solver.
Graph theory Answer checked
Answer
- Vertices and edges
- Degree of each vertex (number of edges meeting there)
- Adjacency matrix
- Handshaking lemmaThe degrees always add up to twice the number of edges.
- Connected?Yes, every vertex can be reached from every other.
- Euler trails and circuitsEuler trail exists (not a circuit): exactly two odd vertices, A and C, so start at one and end at the other.
- Check: the row sums of the adjacency matrix equal the degrees
Change the numbers and solve your own
The method in brief
- List the vertices and count the degree of each.
- Handshaking lemma: the degrees add up to twice the number of edges.
- A graph is connected if you can get from any vertex to any other.
- Euler circuit: connected and all degrees even.
Full guide: Vertices, degrees, connectivity and Euler trails.