Help shape GoConqr. What should we add next?

Quiz

definitions

katie.sissons04 11 questions

Take the quiz

Questions in this quiz (11)

  1. 1what is a graph called that has no edges crossing?
    1. Asimple graph
    2. Bplanar graph
    3. Cconnected graph
  2. 2what is a graph called with no loops or repeated edges?
    1. Asimple graph
    2. Bconnected graph
    3. Cplanar graph
  3. 3what is a simple graph called where every pair of vertices is connected?
    1. Asimple graph
    2. Bconnected graph
    3. Cplanar graph
  4. 4what is a graph called with 2 sets of connected vertices?
    1. A2 part graph
    2. Bbi-varient graph
    3. Cbipartite graph
  5. 5what is a sequence of edges where the end of one edge is the start of the next edge?
    1. Atrail
    2. Bwalk
    3. Ccycle
  6. 6what is a walk with no repeated edges?
    1. Aopen walk
    2. Bclosed walk
    3. Ctrail
  7. 7what is a trail with no repeated vertex?
    1. Acycle
    2. Bpath
    3. Copen trail
  8. 8what is a closed path where the end of one vertex is the start of the next?
    1. Awalk
    2. Btrail
    3. Ccycle
  9. 9what type of cycle visits every vertex exactly once?
    1. Asemi-hamiltonian
    2. Bhamiltonian
    3. Ceularian
  10. 10what is a graph called that has directed edges?
    1. Adigraph
    2. Bbigraph
    3. Cnode graph

Information

Description
maths Quiz on definitions, created by katie.sissons04 on 25/05/2013.
Language
English
Views
39
Tags
maths
Rating
No ratings yet
Rate this quiz
Rate this quiz

More on Graph Terminology and Types

Feedback

What is it about?

What should we add next?