D1 Terms

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

Clues

  • A graph consists of vertices or nodes which are connected by edges or arcs. (5)
  • A graph in which each of the n vertices is connected to every other vertex. (8, 5)
  • A graph which has edges and nodes from a larger graph. (8)
  • A graph with a number associated to each edge (called weight). (7)
  • A graph with directed edges. (7)
  • A matching is the pairing of some or all of the elements of one set, X, with elements of a second set, y. If every X is connected to a Y then the matching is a complete matching. (8)
  • A subgraph which includes all the vertices of G and is also a tree (8, 4)
  • A valency of a vertex is the number of edges incident to it. (13)
  • 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)
  • The total float F(i,j) of activity (i,j) is defined to be F(i,j) = l(j)-e(i)-duration, where e is the earliest time for event i and l is the latest time for event j. (5, 5)

Comments

No comments have yet been made

Similar Mathematics resources:

AQA C4
See all Mathematics resources »See all Decision resources »