Graph Theory Vocab

Front

Vertex

Back

a point

Front

Adjacent vertices

Back

Connected by at least one edge

Front

A loop is an edge that starts and ends at the same vertex.

Back

An edge that starts and ends at the same vertex.

Front

A path is

Back

a series of consecutive edges with no edge repeated.

Front

A graph is connected if each vertex can reach any other vertex.

Back

Each vertex can reach any other vertex.

Front

A graph is complete if every vertex is adjacent to every other vertex.

Back

every vertex is adjacent to every other vertex

Front

Euler Path:

Back

a path containing all edges of a graph (exactly one time)

Front

Euler Circuit

Back

Starts and ends at the same vertex, using each edge once.

Front

A Multi Graph is a graph

Back

that contains a loop or multiple edges between two vertices.