Decision Definitions
- Created by: Issy Haigh
- Created on: 13-05-13 16:54
G | V | K | N | F | G | L | J | I | N | G | C | B | S | E | P | Y | F | G | C | L |
P | U | Q | A | O | I | M | X | T | O | S | Q | M | X | G | G | C | E | F | A | V |
M | N | L | I | Q | D | H | V | E | G | P | C | I | U | P | N | N | A | Q | M | M |
K | I | O | R | B | O | E | X | P | D | V | O | N | K | L | I | E | S | G | K | K |
B | C | O | E | O | N | P | W | H | M | K | M | I | C | L | H | L | I | C | B | T |
Y | C | F | L | B | T | J | L | P | G | X | P | M | E | V | C | A | B | S | T | I |
V | Y | G | U | W | H | B | X | P | O | X | L | U | N | O | T | V | L | E | L | D |
V | N | X | E | T | M | R | B | R | Y | S | E | M | I | O | A | E | E | M | U | M |
U | G | X | E | J | F | Q | R | H | M | P | T | S | L | E | M | E | R | I | N | A |
L | R | R | L | N | U | T | I | A | Q | A | E | P | E | V | L | R | E | T | B | W |
C | G | D | B | Q | M | M | V | N | A | N | M | A | V | E | A | G | G | R | Y | T |
Y | E | Q | A | K | H | C | J | A | U | N | A | N | I | I | M | E | I | A | S | J |
C | U | U | S | Y | T | C | I | B | X | I | T | N | T | Q | I | D | O | V | F | S |
Q | G | S | R | J | I | W | J | A | C | N | C | I | C | E | X | M | N | E | C | T |
S | J | Q | E | S | R | P | U | E | G | G | H | N | E | C | A | Q | R | R | D | C |
V | E | W | V | F | O | Q | P | N | P | T | I | G | J | L | M | C | O | S | I | G |
A | C | K | A | I | G | A | R | K | U | R | N | T | B | V | D | S | I | A | R | T |
R | C | W | R | X | L | R | F | B | K | E | G | R | O | N | A | U | W | B | G | B |
L | S | V | T | Q | A | Y | X | S | Y | E | L | E | R | J | E | R | C | L | P | K |
I | F | X | E | X | B | N | A | J | D | K | P | E | Q | C | U | D | I | E | I | S |
I | E | I | I | H | B | B | N | B | T | P | Q | K | X | P | B | L | L | Y | V | W |
Clues
- A graph is traversable if all the vertices are of even degree (11, 8)
- A line joining all points for which the objective function takes a specified value (9, 4)
- A matching that contains the greatest possible number of edges (7, 8)
- A matching that includes every vertex of the graph (8, 8)
- A spanning tree such that the total weight of the arcs is as low as possible - Kruskal or Prim (7, 8, 4)
- A subgraph which includes all the vertices and forms a tree (8, 4)
- The number of edges a node has attached to it (13)
- the set of (x,y) values that satisfy all the constraints (8, 6, 1)
- Two odd vertices only (4, 11)
- Well defined sequence of steps leading to the solution of a problem of a given type (9)
Similar Mathematics resources:
Teacher recommended
Teacher recommended
Comments
No comments have yet been made