# Math 45 Routing Problems Terminology

| See more in Systems Science

## Terms on Connected Graphs and Euler Paths

Created Date 04.11.20
Last Updated 04.13.20
Viewed 18 Times
Your browser doesn't support HTML5. System.Collections.Generic.List`1[System.String] System.Collections.Generic.List`1[System.String]
0

## Would you like to build your own game?

### It's easy!

Go to the GameBuilder and get started!

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
|
|