Terminology for Graph Theory
- Created by: Jafar Salami
- Created on: 05-06-14 11:06
V | M | T | J | T | C | N | V | T | T | M | Q | O | S | N | S | E | E | E | E | P |
Q | P | K | H | G | Y | R | I | U | B | S | X | Q | T | M | U | L | L | E | K | W |
B | H | Y | W | U | W | V | S | E | U | B | A | J | V | L | C | C | R | I | C | D |
M | P | C | M | J | C | C | I | I | H | U | S | Y | E | Y | Y | T | A | X | G | T |
M | A | A | S | O | T | J | R | H | J | H | W | R | C | C | G | U | L | E | U | B |
E | R | N | F | R | Q | G | Y | V | A | S | I | N | N | N | H | P | O | C | E | K |
E | G | T | D | G | K | V | L | S | Q | A | A | A | I | P | L | D | F | O | S | R |
R | D | G | X | E | U | S | T | U | N | I | I | N | A | A | B | H | J | M | S | G |
T | E | J | N | X | P | O | E | G | N | R | N | R | N | R | L | Q | R | P | T | K |
G | T | X | N | B | E | M | R | O | E | A | G | A | M | L | I | X | S | L | W | R |
N | C | E | E | J | A | A | T | L | P | E | R | E | V | D | P | I | W | E | B | O |
I | E | P | F | J | P | L | U | S | T | G | C | U | P | P | O | V | S | T | X | W |
N | N | W | M | H | I | E | M | I | R | P | P | V | I | B | I | N | O | E | C | J |
N | N | C | X | M | Y | U | T | A | R | U | F | P | R | F | L | J | B | G | S | H |
A | O | H | A | H | M | R | P | A | H | R | T | D | X | B | L | C | F | R | C | M |
P | C | H | N | I | A | H | T | I | P | R | K | N | N | P | G | E | E | A | D | E |
S | P | J | N | P | S | I | M | P | L | E | G | R | A | P | H | M | B | P | T | Y |
L | N | I | I | A | M | S | X | G | I | D | R | Y | J | Y | W | N | M | H | B | C |
X | M | B | M | R | B | X | D | E | G | U | S | S | V | A | H | Y | M | O | W | B |
H | W | J | S | C | D | C | M | N | U | F | C | D | B | U | K | R | R | L | J | F |
N | K | Q | A | N | L | A | P | E | X | X | Q | G | G | G | E | J | Y | P | U | W |
Clues
- A cycle that travels along every edge of the graph. (8, 5)
- A cycle that visits every vertex of the graph. (11, 5)
- A gaph with no odd verticles. (8, 5)
- A graph in which there is a route from each vertex to any other vertex. (9, 5)
- A graph with no loops or multiple edges. (6, 5)
- A simple graph in which every pair of vertices is connected by an edge. (8, 5)
- A spanning tree such that the total length of edges is as small as possible. (7, 8, 4)
- A subgraph of a graph which includes all the vertices of the graph and is also a tree. (8, 4)
- One in which the vertices are in two sets and each edge has a vertex from each set. (9, 5)
- One which can be drawn with no edges crossing. (6, 5)
Similar Mathematics resources:
Teacher recommended
Teacher recommended
Comments
No comments have yet been made