Decision Definitions
- Created by: Issy Haigh
- Created on: 13-05-13 16:54
C | G | T | R | V | U | Q | C | W | S | U | B | G | R | A | P | H | Y | R | P | S |
N | J | V | R | B | M | A | X | I | M | A | L | M | A | T | C | H | I | N | G | U |
D | Y | P | K | J | V | B | T | W | W | I | A | V | I | O | R | V | H | F | P | P |
P | V | B | J | F | V | A | I | K | P | V | B | V | M | U | W | K | C | E | L | U |
Q | Y | R | P | M | G | D | P | I | W | F | O | W | X | Y | W | I | U | A | I | I |
F | K | I | A | L | G | O | R | I | T | H | M | B | H | M | D | B | M | S | N | T |
C | O | M | P | L | E | T | E | M | A | T | C | H | I | N | G | T | I | I | K | V |
T | G | F | G | A | X | I | G | L | T | T | B | Y | O | L | I | N | S | B | F | W |
M | D | E | G | R | E | E | V | A | L | E | N | C | Y | E | T | A | O | L | E | R |
N | H | S | E | M | I | T | R | A | V | E | R | S | A | B | L | E | N | E | G | A |
O | M | M | Q | M | K | W | B | Q | P | L | N | M | Q | H | V | P | Q | R | C | X |
O | B | J | E | C | T | I | V | E | L | I | N | E | C | Y | X | B | D | E | D | U |
H | E | J | K | J | J | V | S | Y | Q | W | E | M | Y | D | L | W | R | G | N | V |
J | M | X | V | K | Q | N | U | T | R | K | U | Q | I | T | C | H | J | I | T | P |
B | C | C | I | L | I | M | P | G | J | O | W | R | H | O | H | G | G | O | Y | U |
C | O | J | N | I | G | V | W | C | C | D | B | S | W | C | C | T | W | N | T | A |
K | O | U | I | W | O | G | U | S | R | N | A | M | X | W | K | W | Y | R | L | Q |
T | R | A | V | E | R | S | A | B | L | E | E | U | L | E | R | I | A | N | A | N |
V | S | P | A | N | N | I | N | G | T | R | E | E | J | J | I | D | U | V | O | T |
F | P | C | A | W | I | F | G | R | R | G | M | A | A | B | G | M | N | S | E | L |
R | C | V | Y | N | Y | R | A | F | C | L | Q | E | V | V | I | W | P | Q | A | M |
Clues
- A graph is traversable if all the vertices are of even degree (11, 8)
- A graph whose vertices belong to the bigger graph it is made up from (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 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