D1 Key Terms

?
  • Created by: Naomi
  • Created on: 06-05-13 22:01
B X L T D E O A Y A Q R E I H S G I H Q P
O A E X Y S V E L G V H E Y D T C G P J T
Y F E S S U C B O N R P R E V X L J K G N
C E H E E I I I S I S A T H H X M E E N E
B T T C G G S P E H E R G P P N C M D H N
U I Y I D Y S A B C M G N A A J O N P N O
H U X T E N P R D T G B I R R R P G U E N
W C V R D J A T G A S U N G G S C P U O C
U R C E E I N I Y M V S N E D H F Y T Y G
M I Y V T S N T S E N B A T E G M T F U C
E C Y D C E I E G T Y G P E T Q M H B B Y
E R V E E F N G H E F O S L H H D V U K V
M O F T R N G R F L C Y M P G H F N K Y T
V E E C I J T A I P L Y U M I O B B E W J
H L X E D W R P N M E P M O E G E Y M T H
H C H N F R E H Q O T K I C W S V L X L C
R Y K N R H E K P C A W N F K D F H L T F
D C H O G J O S W G P P I Y J R O M H C O
F C G C A D Y K U N R Q M T I Q S K S U J
K F B V P T C K L H O R M O F M X K I Q U
C E V N N U V Y Q J A O F P W J D Y W A U

Clues

  • A closed path, ie the end vertex of the last edge is the start vertex of the first edge. (5, 2, 7)
  • A graph ion which each of the n vertices is connected to every other vertex. (8, 5)
  • A graph with a number associated with each edge (usually called its weight). (8, 5)
  • A spanning tree of graph G is a subgraph which includes all the vertices of G and is also a tree. (8, 4)
  • A spanning tree such that the total length of its arcs is as small as possible. (7, 8, 4)
  • A subgraph of G is a graph, each of whose vertices belongs to G and each of whose edges belongs to G. (8)
  • Consists of two sets of vertices X and Y. The edges only join vertices in X to vertices in Y, not vertices within a set. (9, 5)
  • Every member of X is paired with a member of Y. (8, 8)
  • The edges which have a direction associated with them. (8, 5)
  • There is a path between them. (9, 8)

Comments

No comments have yet been made

Similar Mathematics resources:

See all Mathematics resources »