Worked solution: graph with edges AB, BC, CA, DE
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?No, the graph splits into separate parts.
- Euler trails and circuitsNo Euler trail: the graph is not connected.
- 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.