The dots on a graph are called _____

Double edge is called _______

vertex connectors are called ______

"Never leaving the vertex, but leaving the vertex!" is called a ________

A discrepany in an isomorphism is called an ________

Euler cycles must pass along all the ___ in a graph.

The degrees of each vertex for an Euler cycle must be ___

Euler cycles are ______

You cannot _______ edges to create an Euler cycle.

Find an Euler cycle in the following graph: 

The degrees of each vertex for a Hamiltonian cycle must be ___

A Hamiltonian cycle in a graph is _____

When you are finding a Hamiltonian cycle, you can ______ edges.

Find a Hamiltonian cycle in the following graph:

One famous example of this is the _______.

The shortest path Algorithm is used with a ______ graph.

What is the shortest path from 1 to 5?

What is the shortest path from 1 to 3?

What is the shortest path from 3 to 5:

What is the shortest path from A to G:

To show two graphs are isomorphisms, we look to see that each of the two graphs _____

Isomorphisms?

Isomorphisms?

Isomorphisms?

Isomorphisms?

Vertex/verticies

Parallel

edges

loop

invariant

 edges

even

unique

erase/remove/repeat

Can't.  It has odd degree's

2

not unique

elimiante

Many answers

Traveling Salesperson Problem

weighted

6

16

7

22

match/are the same

Yes

No

Yes

Yes