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