Count a planar graph’s faces, vertices and edges and apply Euler’s relation.
Key skillsCount a planar graph’s faces, vertices and edges and apply Euler’s relation.
Build the idea
A graph records relationships through vertices and edges; the drawing’s apparent distances have no meaning unless weights are supplied. Degree counts incident edge ends, so a loop counts twice. A bridge is an edge whose removal increases the number of connected components. Isomorphic drawings preserve adjacency even when positions and labels change.
Try the sample task
An undirected graph has vertices A,B,C,D,E and edges AB,AC,BC,CD,DE. Draw it, list the degrees, identify bridges and construct its adjacency matrix in order A,B,C,D,E.
The full worksheet includes the worked solution and remaining task set.
What this activity covers
This focused activity develops the stated idea through one context. It is practice, not evidence that every application or subclause of a broad study-design bullet has been mastered.