D1 Key Terms
- Created by: BecsaBabe
- Created on: 08-06-15 21:51
P | B | T | H | K | O | T | X | B | J | B | L | X | V | H | T | W | N | X | Y | H |
T | C | C | X | V | P | R | M | Q | P | O | R | J | Q | E | S | I | M | E | P | U |
B | W | M | P | H | R | U | H | T | J | P | E | M | N | O | E | B | I | P | F | C |
H | J | R | L | D | R | T | X | G | O | J | L | R | I | G | U | Q | D | T | K | N |
H | K | I | Y | B | U | V | P | O | I | E | C | N | N | G | L | O | X | K | W | G |
P | R | R | J | S | B | L | N | R | D | R | Y | X | N | T | E | X | Y | C | O | C |
A | R | W | Q | W | I | H | O | W | B | D | C | K | Y | G | R | D | H | O | A | E |
R | B | A | Q | D | P | P | D | R | J | X | N | W | Q | H | I | Y | P | N | U | A |
G | F | N | O | M | A | A | E | H | H | S | A | S | F | Y | A | S | A | N | K | A |
E | C | B | O | I | R | R | P | S | T | P | I | S | P | L | N | Q | R | E | X | W |
T | D | F | W | J | T | G | O | Y | A | A | N | Q | J | L | C | Q | G | C | N | G |
E | H | M | W | P | I | R | I | E | P | N | O | Y | L | I | Y | K | E | T | L | K |
L | S | D | V | J | T | A | N | H | E | N | T | P | W | I | C | K | L | E | U | J |
P | B | X | E | C | E | N | T | T | G | I | L | B | S | G | L | S | P | D | L | G |
M | Q | T | W | A | G | A | V | A | D | N | I | I | F | U | E | P | M | G | C | F |
O | N | Y | B | U | R | L | E | I | E | G | M | E | O | Y | T | W | I | R | O | G |
C | M | E | W | J | A | P | R | R | C | T | A | T | M | I | B | V | S | A | K | I |
S | K | C | T | A | P | U | T | B | R | R | H | K | S | R | K | B | V | P | C | R |
X | R | D | P | I | H | X | E | B | A | E | E | B | O | U | L | R | J | H | V | Y |
Y | W | L | H | M | H | Q | X | U | G | E | X | B | D | U | O | C | J | I | T | O |
I | P | X | Q | F | C | D | L | E | S | Q | J | U | K | Y | P | I | J | R | E | G |
Clues
- A path/walk exists between all nodes (9, 5)
- A single edge between all nodes (8, 5)
- Can be drawn without edges crossing (6, 5)
- Cycle which goes through every vertex once (11, 5)
- Cycle which traverses every edge exactly once. (must have 0 or 2 odd nodes) (8, 5)
- Have 2 sets of nodes. Nodes in the same set do not have edges between them (9, 5)
- No loops or repeated edges (6, 5)
- Place on a graph where arcs meet (15)
- Represents distance between two nodes (11)
- Tree which includes and connects all nodes on a graph (8, 4)
Similar Mathematics resources:
Teacher recommended
Comments
No comments have yet been made