Graphs and Network Progress Quiz

Lines or curves that connect vertices are called

• 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 that are joined edges.

• 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

Every path is a trail.

• TRUE

• FALSE

A walk that has no repeated edges (but can

revisit vertices).

• Path

• Trail

• Eulerian trail

• Hamiltonian circuit

Two vertices are called __________ if they are attached directly by at least one edge.

• adjacent

• connected

• planar

• complete

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 __________ is removed, it will leave the graph disconnected.

• node

• region

• bridge

• loop