D1 OCR Graph Definitions

HideShow resource information
A graph which has exactly 2 odd nodes
Semi-eulerian graph
1 of 11
A sequence of arcs such that the end of one is the start of another
A trail
2 of 11
A trail where no node is passed through more than once
A path
3 of 11
A graph which has no odd nodes
Eulerian graph
4 of 11
A closed trail where only the start and end nodes are the same
A cycle
5 of 11
A connected graph that has a closed trail containing every arc once and only once
Eulerian graph
6 of 11
A connected graph with no cycles
A tree
7 of 11
A graph with weighted edges
A network
8 of 11
A graph which goes through every node
Hamilton cycle
9 of 11
A graph which has no loops or multiple arcs
Simple graph
10 of 11
A graph which has two sets of nodes
Bipartite graph
11 of 11

Other cards in this set

Card 2

Front

A sequence of arcs such that the end of one is the start of another

Back

A trail

Card 3

Front

A trail where no node is passed through more than once

Back

Preview of the front of card 3

Card 4

Front

A graph which has no odd nodes

Back

Preview of the front of card 4

Card 5

Front

A closed trail where only the start and end nodes are the same

Back

Preview of the front of card 5
View more cards

Comments

daviesg

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. 

Similar Mathematics resources:

See all Mathematics resources »See all Graphs and transformations resources »