Networks and graphs

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

• Regions

• Vertices

• Edges

• Paths

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

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 has no repeat use of edges or vertices (except perhaps to end at the starting vertex).

• Path

• Closed walk

• Open walk

• Trail

A walk that has no repeated edges (but can

revisit vertices).

• Path

• Trail

• Eulerian trail

• Hamiltonian circuit

Every vertex in this network is (blank) to every other vertex.

• adjacent

• connected

• planar

• disconnected

If a (blank) is removed, it will leave the graph disconnected.

• node

• region

• bridge

• loop