D1 OCR Graph Definitions

Get Revising

Created by: Josh Williams
Created on: 15-05-13 12:30



				2
4

			7

	5


		1

6

		9


10

Across

1. A sequence of arcs such that the end of one is the start of another (1, 5)
4. A graph which has exactly 2 odd nodes (4, 8, 5)
5. A graph which has two sets of nodes (9, 5)
6. A graph with weighted edges (1, 7)
7. A trail where no node is passed through more than once (1, 4)
9. A graph which has no odd nodes (8, 5)
10. A connected graph that has a closed trail containing every arc once and only once (8, 5)

Down

1. A connected graph with no cycles (1, 4)
2. A graph which has no loops or multiple arcs (6, 5)
6. A closed trail where only the start and end nodes are the same (1, 5)

Comments

daviesg

Report Wed 19th February, 2014 @ 19:44

Card 9 should read 'Hamiltonian'

But otherwise a nice set of cards defining terms in Decision Maths (D1). Make sure you learn the difference between Hamiltonian cycle and Eurerian trail.