Decision 1 cards

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

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 »