Graphs & Networks
Topic overview
Training in rule-based path, tree and network reasoning as specified in the question; this is not a verified complete set of current CSAT knowledge requirements.
Key concepts
Supplementary assessment for some colleges; currently available public sources are insufficient to confirm the paper structure on this site. For preparation training only; no claim is made that it is a current full mock paper.
Key points
- ◆Follow the prerequisite knowledge requirements given by the examination body; new concepts may only be used when the question provides sufficient guidance.
- ◆The examples on this site are training with a limited scope and do not represent full syllabus coverage or official difficulty.
Worked examples
Try each example yourself before checking the explanation.
Prove that every finite tree with at least two vertices has at least two leaves.
Show that deleting a leaf from a tree leaves a tree.
Use induction to show a tree with n vertices has n-1 edges.
Ready to practise this topic?
Practise the available questions for this topic. Difficulty labels are platform references.
Practise Graphs & Networks →