Math 45 Routing Problems Terminology
|
See more in Systems Science
Terms on Connected Graphs and Euler Paths
Create multiple-choice games on Wisc-Online and play them on our Chakalaka mobile app!
But that's not all! Explore educational games created by others. Simply search by category or enter agame code number and dive into a world of learning and fun.
Download the Chakalaka mobile app here:
Topics of this game:
- An edge that connects a vertex to itself
- 2 or more edges which share at least 1 common vertex
- Vertices that have at least 1 edge joining them
- Number of edges coming out of a vertex
- The sum of all the vertex degrees
- A sequence of adjacent vertices
- A route that begins and ends at the same vertex
- A route that begins and ends at different vertices
- A figure containing 1 or more vertices (dots) and 1 or more edges (lines)
- A graph which is not connected
- 2 or more edges that connect the same vertices
- When 2 graphs have a one-to-one correspondence between their vertices and edges
- An edge of a connected graph which, if and when taken away, would turn the graph into a disconnected graph
- A route that traverses every edge of a connected graph
- An Euler Route that starts and ends at different vertices
- An Euler Route that starts and ends at the same vertex
- A vertice that has an odd number of edges coming out of it
