Graph Theory Quiz

A path that uses every edge in a graph with no repeats AND it must start and end at the same vertex is called a(n):

A special type of edge that connects a vertex to itself is known as a:

An edge which when removed causes the graph to become disconnected is called a:

A path that begins and ends at the same vertex is referred to as a:

A path that uses every edge in a graph with no repeats is known as a(n):

This connects a pair of vertices:

The number of edges meeting at a vertex is called the:

A dot in a graph where edges meet is known as a:

Find the degree of vertex b.

• 1

• 2

• 3

• 4

Which vertices are adjacent to vertex b?

• a and c

• a and d

• c and d

• a, c, and d

Tags

CCSS.HSG.CO.A.1