Travelling a Network (HSC SSCE Mathematics Standard): Flashcards
📚Flashcards
Practise the cards
10 cards from this deck
ShowHide
Practise the cards
10 cards from this deck
Two fundamental components of a network
Two fundamental components of a network
Vertices (points/locations) and edges (connections)
Definition of a walk in a network
Definition of a walk in a network
Connected sequence of edges; can repeat edges and vertices
Definition of a trail in a network
Definition of a trail in a network
Walk with no repeated edges; vertices can repeat
Definition of a path in a network
Definition of a path in a network
Walk with no repeated vertices
Definition of a circuit in a network
Definition of a circuit in a network
Walk with no repeated edges, starts and ends at same vertex
Definition of a cycle in a network
Definition of a cycle in a network
Walk with no repeated vertices, starts and ends at same vertex
Most flexible type of route through a network
Most flexible type of route through a network
Walk
Most restrictive type of closed route
Most restrictive type of closed route
Cycle
Definition of a traversable graph
Definition of a traversable graph
Has a trail that includes every edge
Key restriction of trails vs walks
Key restriction of trails vs walks
No repeated edges (walks allow repeated edges)