Decision 1 cards

?
  • Created by: Sara
  • Created on: 20-04-13 16:25
J N X N H T G D I H N I H Q R E T E S C B
C L A K P F U M H Q Y S H H P L V F U Q F
G R L O A V R N R E C Y P P T C X D D S Y
Q D Q H R V O X K V O A A A Y Y Q G I P C
H F I D G T U I A B M M R R O C N Y R Y D
P H E W E M X R B E P V G G X N Y D E Q I
A P I E T L O T J Q L P N N M A W E C W M
R A V I I F G A A Y E R A A U I U K T F D
G R F G T O I M N D T V I I N N P W E K H
D G W H R E C Y F W E I R R O O O C D U E
E E M T A Q V C C K G H A A H T V F G F L
T L S E P E T N N U R D L L S L L E R X F
C P N D I F M E H U A Q U U A I P P A F G
E M G G B S E C W W P M E E N M Q F P W D
N I U R D C N A C D H N I P M A U P H V E
N S V A Q J S J J O T A M O P H T F H S G
O V A P E S H D L D G W E D N E H E H P J
C Q J H G X K A H X B P S P T H D F R O S
N E E U L T V I N S D U G G Y P P E B Y O
O Q V N S W G I M D P X U F M F T A Q J D
T H H R H E W Q T A U W A H C X L Q Y T N

Clues

  • A connected graph which has a closed trail connecting every edge exactly once (Only if every vertex has an even order) (8, 5)
  • A cycle that visits every vertex of a graph (11, 5)
  • A graph that has no loops and at most one edge connects any pair of vertices (6, 5)
  • A graph where a path can be found connecting any 2 vertices (9, 5)
  • A graph where every vertex is connected to every other vertex by exactly one edge (1/2n(n-1)) (8, 5)
  • A graph which has a direction associated with at least some of the edges (8, 5)
  • A graph which has a number linked to each edge (8, 5)
  • A graph which has a trail which is not closed that contains every edge exactly once (4, 8, 5)
  • A table that shows the weights or directions on a graph (9, 6)
  • The vertices are in 2 sets and the edges only join a vertices in different sets (9, 5)

Comments

No comments have yet been made

Similar Mathematics resources:

D1
See all Mathematics resources »See all Networks, algorithms and problem solving resources »