In the graph shown, D is an example of a(n) ________ .

• Edge

• Vertex

• Path

• Sling

In the graph shown, (A, F) is an example of a(n) ________ .

• Edge

• Vertex

• Path

• Sling

In the graph shown, A, B, E is an example of a(n) ________ .

• Edge

• Vertex

• Path

• Sling

Which of the following is a cycle shown in the graph?

• B, F, A, B

• A, B, E

• A, E, D, A

• A, C, B, D, A

Which of the following is not an edge in this graph?

• (A, D)

• (D, A)

• (F, A)

• (A, E)

Vertices are considered adjacent if ________ .

• An edge connects them

• There is a path from one vertex to the other

• Both vertices are contained in a cycle

• The length of the path between them is less than 5

A complete graph is a graph _________ .

• where every vertex has a degree >= 1

• that has the maximum number of edges connecting vertices

• that for any two vertices, the graph has a path

• that has at least one edge to every vertex

The formula for finding the number of edges in a complete graph is ________ where V is the number of vertices.

• V (V+1) / 2

• 2 (V+1) / V

• V (V-1) / 2

• (V+2) / 2

The number of edges needed in a complete graph with 5 vertices is ________ .

• 10

• 15

• 5

• 25

What is the length of the path F, A, C, B, D?

• 3

• 4

• 5

• 6