Graphs and Networks - Glossary

Choose the correct term to match each definition: Lines or curves that connect vertices.

• Regions

• Vertices

• Edges

• Paths

Tags

CCSS.4.G.A.1

An edge that begins and ends at the same vertex.

• Multiple edges

• Vertices

• Loop

• Node

Links that connect the same two vertices to one another.

• Multiple edges

• Vertices

• Loop

• Nodes

When the edges have a numerical representation (to indicate length, time, capacity etc.).

• Multiple edges

• Weighted graph

• Complete graph

• Directed graph

No arrows are shown on the edges.

• Directed graph

• Weighted graph

• Simple graph

• Undirected graph

An undirected and unweighted graph with no multiple edges.

• Undirected graph

• Unweighted graph

• Incomplete graph

• Simple graph

A sequence of vertices for which each vertex in the sequence is joined to the next vertex in the sequence by an edge.

• Walk

• Closed walk

• Path

• Trail

A walk that doesn’t finish at the starting vertex.

• Walk

• Closed walk

• Open walk

• Trail

A walk that has no repeat use of edges or vertices (except perhaps to end at the starting vertex).

• Path

• Closed walk

• Open walk

• Trail

Every path is a trail.

• TRUE

• FALSE