Walks trails paths cycles circuits

An edge that begins and ends at the same vertex.

• Multiple edges

• Vertices

• Loop

• Node

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

• Walk

• Circuit

• 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

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

State the number of vertices in the following graph?

• 7

• 0

• 5

• 6

What is the number of edges in this network

• 13

• 10

• 12

• 9

Adjacency matrices represent the number of edges that connect vertices.

• True

• False