D1

?
  • Created by: Varya
  • Created on: 19-03-13 17:12
T W F H O D S L O W N M A X J J O F S F R
X E G R U R P D Y X W P Q I L L O K I U J
I I B T X P P S P S W Y Q R H G R G S M V
R G X J Y T H W U D C E R T P E D H F D B
T H L C C L S K F B X F Y A A E H W K R K
A T A P D A X Q D K J I V M R R P C D J E
M E C R I P R U U O N S S Y G T A R N C R
E D Y O R W C B L B S O C C E G R S T K B
C G C C E I O P L W X M S N L N G U E B N
N R L J C U M H A P M O L E P I E Y H X F
A A E F T Q P D F C O R A C M N T T J X L
T P C I E E L U A C J P Q A I N I T V O D
S H I B D V E K F P V H O J S A T F U O V
I N R J E U T T M Y C I E D A P R R G X M
D E C E D P E F D X C C C A B S A L C S B
T T U A G Y G G K D K G D T A V P K S Y X
S W I M E L R F H O M R H S Q V I O S N X
N O T N S F A W I G W A G P O H B W K R O
K R I R J E P W A N U P T D F R A H W H O
T K R P O I H W O M N H U X H S C W C X T
A H B B P E O L T V T C S C W R C H J F D

Clues

  • consists of two sets of vertices, X and Y. The edges only join vertices in X to vertices in Y, not vertices withon a set (9, 5)
  • G is a subgraph which includes all the vertices of G and is also a tree (8, 4)
  • graph has a number associated with each edge (its weight) (8, 5, 7)
  • graph in which every vertex is directly connected by an edge to each of the other vertices. If the graph has n vertices the connected graph is donated Kn (8, 5)
  • if the edges of a graph (digraph) have a direction associated with them (8, 5)
  • is a closed 'path', i.e the end vertex of the last edge is the start vertex of the first edge (1, 5, 7)
  • is one in which there are no loops and not more than one edge connecting any pair of vertices (1, 6, 5)
  • recirds the weights on the edges. Where is no weight, this is indicated by '-' (8, 6)
  • records the number of direct links between vertices (9, 6)
  • show the same information but are drawn differently (10, 5)

Comments

No comments have yet been made

Similar Mathematics resources:

D1
FP2
See all Mathematics resources »