Q3.1 Graph Theory Vocab (QZ)

Front

How many vertices does the graph contain?

Back

6

Front

Definition: A circuit that covers all the edges of the graph

Back

Euler Circuit

Front

How many vertices does the graph contain?

Back

5

Front

You can tell a graph has an Euler Circuit if it has no vertices with an ___________ degree.

Back

Odd

Front

What is it called when you can go through every edge on a graph exactly once and end back where you started?

Back

Euler Circuit

Front

What is a graph?

Back

A collection of vertices connected by edges.

Front

What is a vertex in graph theory?

Back

A point where two or more edges meet.

Front

What is an edge in graph theory?

Back

A line connecting two vertices.

Front

What is an Euler Path?

Back

A path that visits every edge of a graph exactly once but does not necessarily return to the starting vertex.

Front

What is a connected graph?

Back

A graph in which there is a path between every pair of vertices.