Degrees 1
Try VividMath Premium to unlock full access
Time limit: 0
Quiz summary
0 of 4 questions completed
Questions:
- 1
- 2
- 3
- 4
Information
–
You have already completed the quiz before. Hence you can not start it again.
Quiz is loading...
You must sign in or sign up to start the quiz.
You have to finish following quiz, to start this quiz:
Loading...
- 1
- 2
- 3
- 4
- Answered
- Review
-
Question 1 of 4
1. Question
Using the image below, find the value of the following:
-
`(i)` Degree of Vertex `A``=` (2)`(ii)` Degree of Vertex `D``=` (3)`(iii)` Number of Vertices with `\text(Degree) 4``=` (3)
Hint
Help VideoCorrect
Great Work!
Incorrect
A degree is the number of edges that connects to a vertex.`(i)` Degrees of Vertex `A`Count the edges connecting to vertex `A`.
There are `2` edges connected to vertex `A`. Therefore, the degree of vertex `A` is `2`.`(ii)` Degrees of Vertex `D`Count the edges connecting to vertex `D`.
There are `3` edges connected to vertex `D`. Therefore, the degree of vertex `D` is `3`.`(iii)` Vertices with `\text(Degree) 4`Get the degrees of all the vertices and count how many vertices has `4` edges connecting to them.
The vertices `B`, `E`, and `F` all have `4` edges connecting to them. Therefore, there are `3` vertices that are `\text(degree) 4`.`(i)` Degree of `A=2``(ii)` Degree of `D=3``(iii)` Vertices with `\text(Degree 4)=3` -
-
Question 2 of 4
2. Question
Using the image below, find the value of the following:
-
`(i)` Degree of Vertex `A``=` (3)`(ii)` Degree of Vertex `B``=` (3)`(iii)` Degree of Vertex `C``=` (2)`(iv)` Degree of Vertex `D``=` (4)`(v)` Degree of Vertex `E``=` (2)
Hint
Help VideoCorrect
Correct!
Incorrect
A degree is the number of edges that connects to a vertex.`(i)` Degrees of Vertex `A`Count the edges connecting to vertex `A`.
There are `3` edges connected to vertex `A`. Therefore, the degree of vertex `A` is `3`.`(ii)` Degrees of Vertex `B`Count the edges connecting to vertex `B`.
There are `3` edges connected to vertex `B`. Therefore, the degree of vertex `B` is `3`.`(iii)` Degrees of Vertex `C`Count the edges connecting to vertex `C`.
There are `2` edges connected to vertex `C`. Therefore, the degree of vertex `C` is `2`.`(iv)` Degrees of Vertex `D`Count the edges connecting to vertex `D`.
There are `4` edges connected to vertex `D`. Therefore, the degree of vertex `D` is `4`.`(v)` Degrees of Vertex `E`Count the edges connecting to vertex `E`.
There are `2` edges connected to vertex `E`. Therefore, the degree of vertex `E` is `2`.`(i)` Degree of `A=3``(ii)` Degree of `B=3``(iii)` Degree of `C=2``(iv)` Degree of `D=4``(v)` Degree of `E=2` -
-
Question 3 of 4
3. Question
Using the image below, find the value of the following:
-
`(i)` Degree of Vertex `P``=` (2)`(ii)` Degree of Vertex `Q``=` (4)`(iii)` Degree of Vertex `R``=` (2)`(iv)` Degree of Vertex `S``=` (2)
Hint
Help VideoCorrect
Keep Going!
Incorrect
A degree is the number of edges that connects to a vertex.`(i)` Degrees of Vertex `P`Count the edges connecting to vertex `P`.
There are `2` edges connected to vertex `P`. Therefore, the degree of vertex `P` is `2`.`(ii)` Degrees of Vertex `Q`Count the edges connecting to vertex `Q`.
There are `4` edges connected to vertex `Q`. Therefore, the degree of vertex `Q` is `4`.`(iii)` Degrees of Vertex `R`Count the edges connecting to vertex `R`.
There are `2` edges connected to vertex `R`. Therefore, the degree of vertex `R` is `2`.`(iv)` Degrees of Vertex `S`Count the edges connecting to vertex `S`.
There are `2` edges connected to vertex `S`. Therefore, the degree of vertex `S` is `2`.`(i)` Degree of `P=2``(ii)` Degree of `Q=4``(iii)` Degree of `R=2``(iv)` Degree of `S=2` -
-
Question 4 of 4
4. Question
Using the image below, find the value of the following:
-
`(i)` Degree of Vertex `A``=` (4)`(ii)` Degree of Vertex `B``=` (2)`(iii)` Degree of Vertex `C``=` (5)`(iv)` Degree of Vertex `D``=` (2)`(v)` Degree of Vertex `E``=` (1)
Hint
Help VideoCorrect
Fantastic!
Incorrect
A degree is the number of edges that connects to a vertex.`(i)` Degrees of Vertex `A`Count the edges connecting to vertex `A`.
There are `4` edges connected to vertex `A`. Therefore, the degree of vertex `A` is `4`.`(ii)` Degrees of Vertex `B`Count the edges connecting to vertex `B`.
There are `2` edges connected to vertex `B`. Therefore, the degree of vertex `B` is `2`.`(iii)` Degrees of Vertex `C`Count the edges connecting to vertex `C`.
Notice that there is a loop connected to vertex `C`.
A loop consists of `2` edges. Therefore, there are a total of `5` edges connected to vertex `C`. Therefore, the degree of vertex `C` is `5`.`(iv)` Degrees of Vertex `D`Count the edges connecting to vertex `D`.
There are `2` edges connected to vertex `D`. Therefore, the degree of vertex `D` is `2`.`(v)` Degrees of Vertex `E`Count the edges connecting to vertex `E`.
There is `1` edge connected to vertex `E`. Therefore, the degree of vertex `E` is `1`.`(i)` Degree of `A=4``(ii)` Degree of `B=2``(iii)` Degree of `C=5``(iv)` Degree of `D=2``(v)` Degree of `E=1` -
Quizzes
- Vertices and Edges
- Degrees 1
- Degrees 2
- Degrees 3
- Drawing a Network 1
- Drawing a Network 2
- Completing a Table from a Network Diagram
- Network from Maps and Plans
- Identify Paths and Cycles
- Eulerian Trails and Circuits 1
- Eulerian Trails and Circuits 2
- Identify Spanning Trees
- Minimum Spanning Trees 1
- Minimum Spanning Trees 2
- Shortest Path 1
- Shortest Path 2