D1 OCR Graph Definitions

Teacher recommended

?
E B R T J P F H N X N K I G U H B H Q Q Y
B I R G P H S P V D T W F Y U R W A T T O
A P U G K P R A X D S R J Q W G P M W B D
W A Q B E A C R U C R N Q O D U M I N S W
Y R M S M R E G C R L C G H Y S O L X O S
E T H K N G B N E G H A F J Y W D T C D Y
O I T X X E A A L H P N M F B I M O N T Y
O T A J W L Q I C J A T R A I L T N G A F
B E P L O P H R Y V R X O W K L A C N E V
N G A Q B M L E C T G Y G I Q N P Y B T H
Y R C V D I K L A Y N S O T Y G H C I X T
M A R P D S W U D Q A Q J X S U R L M K A
C P F M L T Y E K X I Y B A U N U E G C P
I H H O T R B I V T R D O E C N S R V B X
N U G A R P M M J K E U Y E D V K S V B M
Y K J P U T S E T Y L Y Y R Y E H S L L P
O K G N Q O E S R W U C N T E O I W A A H
A N E T W O R K M C E V E A L H R Y R S T
Q P N P A L F M T U B Y M F J N J Y N Q A
T V L O V P M R U X H A D C G I W Q K L G
T T X I B T R W M R W B W C H M L M K U I

Clues

  • A closed trail where only the start and end nodes are the same (1, 5)
  • A connected graph with no cycles (1, 4)
  • A graph which goes through every node (8, 5)
  • A graph which has exactly 2 odd nodes (4, 8, 5)
  • A graph which has no loops or multiple arcs (6, 5)
  • A graph which has no odd nodes (8, 5)
  • A graph which has two sets of nodes (9, 5)
  • A graph with weighted edges (1, 7)
  • A sequence of arcs such that the end of one is the start of another (1, 5)
  • A trail where no node is passed through more than once (1, 4)

Comments

daviesg

Report

Card 9 should read 'Hamiltonian'

But otherwise a nice set of cards defining terms in Decision Maths (D1).  Make sure you learn the difference between Hamiltonian cycle and Eurerian trail. 

Similar Mathematics resources:

See all Mathematics resources »See all Graphs and transformations resources »