1.16.08 6th seminar

Today we started problems in the field of discrete math.

Remember:
A vertex is a point
An edge is a segment joining two vertices
The size of a graph is the number of vertices
The degree of a vertex is the number of edges it has
A regular graph has vertices with the same degree
Graphs are isomorphic when they have the same characteristics

Find a path on each of these vertex-edge graphs that crosses each edge only once. These are called “Hamiltonian Paths”