Traversing a Graph (AQA A-Level Further Maths): Flashcards
📚Flashcards
Practise the cards
10 cards from this deck
ShowHide
Practise the cards
10 cards from this deck
Walk definition
Walk definition
Journey w/ no restrictions on repeating edges or vertices
Trail definition
Trail definition
Walk where no edge is repeated
Path definition
Path definition
Walk w/ no edges or vertices repeated
Cycle definition
Cycle definition
Closed path, starts/ends at same vertex, no repeats
Hamiltonian cycle definition
Hamiltonian cycle definition
Cycle visiting every vertex exactly once
Tree definition
Tree definition
Connected graph with no cycles
Eulerian graph condition
Eulerian graph condition
All vertices have even degree
Semi-Eulerian graph condition
Semi-Eulerian graph condition
Exactly two vertices with odd degree
Non-Eulerian graph condition
Non-Eulerian graph condition
More than two vertices with odd degree
No. of odd degree vertices in any graph
No. of odd degree vertices in any graph
Must be even
