| Parts | ||
| #1 | The dots on a graph are called _____ |
Vertex/verticies |
| #2 | Double edge is called _______ |
Parallel |
| #3 | vertex connectors are called ______ |
edges |
| #4 | "Never leaving the vertex, but leaving the vertex!" is called a ________ |
loop |
| #5 | A discrepany in an isomorphism is called an ________ |
invariant |
| Euler | ||
| #1 | Euler cycles must pass along all the ___ in a graph. |
edges |
| #2 | The degrees of each vertex for an Euler cycle must be ___ |
even |
| #3 | Euler cycles are ______ |
unique |
| #4 | You cannot _______ edges to create an Euler cycle. |
erase/remove/repeat |
| #5 | Find an Euler cycle in the following graph: |
Can't. It has odd degree's |
| Hamilton | ||
| #1 | The degrees of each vertex for a Hamiltonian cycle must be ___ |
2 |
| #2 | A Hamiltonian cycle in a graph is _____ |
not unique |
| #3 | When you are finding a Hamiltonian cycle, you can ______ edges. |
elimiante |
| #4 | Find a Hamiltonian cycle in the following graph: |
Many answers |
| #5 | One famous example of this is the _______. |
Traveling Salesperson Problem |
| Shortest Path | ||
| #1 | The shortest path Algorithm is used with a ______ graph. |
weighted |
| #2 | What is the shortest path from 1 to 5? |
6 |
| #3 | What is the shortest path from 1 to 3? |
16 |
| #4 | What is the shortest path from 3 to 5: |
7 |
| #5 | What is the shortest path from |
22 |
| Isomorphisms | ||
| #1 | To show two graphs are isomorphisms, we look to see that each of the two graphs _____ |
match/are the same |
| #2 | Isomorphisms? |
Yes |
| #3 | Isomorphisms? |
No |
| #4 | Isomorphisms? |
Yes |
| #5 | Isomorphisms? |
Yes |
| Final Question | |
A to G:
