Graph Theory Quiz

A circuit in a graph is a path that begins and ends at the same vertex.

• True

• False

A graph that uses each edge only once is a(n)_____________

• Euler

• Hamiltonian

The _______________ of a vertex is the number of edges that touch that vertex

• path

• type

• degree

• edge

According to Euler's theorem, a connected graph has an Euler circuit precisely when every vertex has odd degree.

• True

• False

• 1

• 2

• 3

• 4

• True

• False

• Office C to Office D

• Office A to Office D

• Office C to Office B

• Office B to Office D

When graphs are represented pictorially using dots and segments, the dots are called:

• Edges

• Graphs

• Degrees

• Vertexes

When graphs are represented pictorially using dots and segments, the segments connecting the dots are called

• Edges

• Graphs

• Maps

• Vertexes

• A and B

• C and D

• B and E

• D and F