Revision for Graphs and Networks

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

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 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 it is possible to create a walk from one vertex to any other vertex, the network must be ...

• connected

• planar

• complete

• disjoint

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

• node

• region

• bridge

• loop

A graph that can be drawn in 2D without crossing of edges.

• bipartite

• connected

• complete

• planar

A connected graph that does not contain a cycle.

• path

• walk

• circuit

• tree