Quiz
definitions
Create a free account to finish this quiz
Save your progress and see your final score.
Already have an account? Sign in
Questions in this quiz (11)
1what is a graph called that has no edges crossing?
- Asimple graph
- Bplanar graph
- Cconnected graph
2what is a graph called with no loops or repeated edges?
- Asimple graph
- Bconnected graph
- Cplanar graph
3what is a simple graph called where every pair of vertices is connected?
- Asimple graph
- Bconnected graph
- Cplanar graph
4what is a graph called with 2 sets of connected vertices?
- A2 part graph
- Bbi-varient graph
- Cbipartite graph
5what is a sequence of edges where the end of one edge is the start of the next edge?
- Atrail
- Bwalk
- Ccycle
6what is a walk with no repeated edges?
- Aopen walk
- Bclosed walk
- Ctrail
7what is a trail with no repeated vertex?
- Acycle
- Bpath
- Copen trail
8what is a closed path where the end of one vertex is the start of the next?
- Awalk
- Btrail
- Ccycle
9what type of cycle visits every vertex exactly once?
- Asemi-hamiltonian
- Bhamiltonian
- Ceularian
10what is a graph called that has directed edges?
- Adigraph
- Bbigraph
- Cnode graph
11what is a simple connected graph containing no cycles?
- Atrail
- Bwalk
- Ctree
Information
- Description
- maths Quiz on definitions, created by katie.sissons04 on 25/05/2013.
- Author
- katie.sissons04
- Language
- English
- Views
- 39
- Tags
- Rating
- No ratings yet Rate this quiz
More on Graph Terminology and Types