Other questions in this quiz

2. What is a Trail

  • A sequence of edges of a graph such that the second vertex of each edge is the first vertex of the next edge, with no edge included more than once.
  • closed path with at least one edge

3. What is a Path

  • a closed trail with at least n-1 edges
  • A trail such that no vertex is visited more than once
  • A sequence of edges of a graph such that the second vertex of each edge is the first vertex of the next edge, with no edge included more than once.

4. If a graph has directed edges we do not call it a...

  • directed graph
  • directional graph
  • digraph

5. What is a Hamiltonian cycle?

  • A cycle that visits every vertex of a grpah
  • A cycle that can be retraced without going over any edge more than once

Comments

No comments have yet been made

Similar Mathematics resources:

See all Mathematics resources »See all Graphs and transformations resources »