D1 definitions
- Created by: SamDavies
- Created on: 17-06-16 10:23
H | I | N | C | N | O | I | S | X | F | B | X | G | F | K | Y | K | Q | C | B | I |
I | U | L | C | P | O | G | H | I | M | H | I | N | O | R | D | S | K | U | J | A |
B | X | Q | S | V | A | G | P | R | Q | P | R | I | C | U | U | P | M | C | N | N |
J | B | S | J | U | E | P | A | T | C | A | T | H | O | P | L | A | S | I | Y | V |
O | S | M | V | O | H | G | R | A | W | R | A | C | M | F | E | N | N | S | Q | O |
Y | A | C | B | X | A | N | G | M | G | G | M | T | P | B | A | N | U | O | G | D |
S | A | P | E | H | B | I | E | E | L | D | Y | A | L | I | K | I | P | R | A | C |
C | E | R | X | I | X | H | T | C | D | E | C | M | E | S | C | N | B | M | Q | P |
O | K | E | V | D | C | C | I | N | K | T | N | E | T | T | M | G | M | O | H | E |
J | G | G | P | R | J | T | T | A | J | C | E | T | E | Q | T | T | P | R | F | V |
P | B | U | N | B | H | A | R | T | G | E | C | E | G | B | F | R | U | P | T | K |
J | D | K | J | U | U | M | A | S | U | N | A | L | R | D | W | E | K | H | S | Q |
H | O | O | K | U | S | L | P | I | H | N | J | P | A | A | M | E | C | I | E | B |
Q | U | C | G | O | V | A | I | D | S | O | D | M | P | Y | U | A | O | C | U | O |
B | S | J | Q | I | L | M | B | C | P | C | A | O | H | T | S | J | X | G | S | C |
P | F | T | A | T | V | I | A | S | I | A | K | C | A | R | L | S | I | R | I | I |
H | P | O | V | K | T | X | N | A | R | P | L | G | I | S | M | J | K | A | I | T |
A | N | O | N | T | R | A | V | E | R | S | I | B | L | E | G | R | A | P | H | O |
E | C | D | R | K | R | M | I | K | Y | S | X | T | N | K | T | I | F | H | J | T |
J | K | Y | N | A | N | F | R | A | Y | G | J | V | F | S | O | T | I | S | X | Y |
E | X | U | B | W | D | Y | L | G | N | J | J | I | U | V | B | I | X | D | M | F |
Clues
- A graph in which every vertex is directly connected by an edge to each of the other vertices. If the graph has n vertices, then the connected graph is denoted by Kn (8, 5)
- A graph with more than two odd vertices (1, 3, 11, 5)
- A matching in of two sets, each containing n nodes, which has n arcs (8, 8)
- A matching in which the number of arcs is as big as possible (7, 8)
- A matrix which records the number of direct links between vertices (9, 6)
- A matrix which records the weights on the edges of a weighted graph (8, 6)
- A subgraph which includes all the vertices of the original graph and is also a tree (8, 4)
- Consists of two sets of vertices, X and Y. The edges only join vertices in X with vertices in Y, not vertices within a set (9, 5)
- Graphs that show the same information but are drawn differently (11, 6)
- Two vertices are connected if there is an arc between them. A graph is connected if all its vertices are connected (9, 5)
Comments
No comments have yet been made