Other questions in this quiz

2. What is an Eulerian Graph

  • A graph which can be drawn in a plane in such a way that arcs only meet at nodes
  • A connected graph which has a closed trail containing every arc precisely once
  • A graph with two sets of nodes such that arcs only connect nodes from one set to the other

3. The order of a node, is the number of arcs meeting at that node

  • True
  • False

4. A tree has cycles

  • False
  • True

5. What is a Spanning Tree?

  • A connected graph with cycles
  • A connected graph with NO cycles
  • Pretty :3
  • A subgraph which is a tree connecting all the nodes of the graph
  • A graph without loops or multiple arcs

Comments

Naseem

Report

  1. easy
Charlotte Wilding

Report

Naseem wrote: Haha :D

Similar Further Maths resources:

See all Further Maths resources »