Graph Theory

Vertices or Vertex Set

Number of edges coming off a vertice

A route through a graph along edges from one vertex to the next

A walk where no vertex is visited more than once

A walk where no edge is visited more than once

A walk which the end vertex is the same as the start vertex where no other vertex is visited more than once

A cycle that includes every vertex

A connected graph with no cycles

Includes all vertices and is a tree

Every vertex is directly connected by a single edge to each of the other vertices

Show the same information but may be drawn differently

One that can be drawn in a plane such that no 2 edges meet except at a vertex

Covers every edge exactly once can start and end at any vertex. The degree of each vertice is even

Same as Eulerian but ends on a different vertex. It always has two odd degrees