Language and properties of graphs Quiz
Studying this course? Keep your progress in one place.
Pick an answer for each. Quizzes never use energy.
5 questions, one answer each
Each answer is checked as you go, with why.
See all 5 questions
1. A vertex has one loop and one other edge. What is its degree?
- A.
- B.
- C.
- D.
2. A connected graph has four vertices of odd degree. Which statement must be true?
- A. It is Eulerian
- B. It is semi-Eulerian
- C. It is Hamiltonian
- D. It is neither Eulerian nor semi-Eulerian
3. A graph has edges. What is the sum of the degrees of its vertices?
- A.
- B.
- C.
- D.
4. What is a walk with no repeated edge called?
- A. A trail
- B. A cycle
- C. A path
- D. A subdivision
5. An edge is subdivided once. How do the numbers of vertices and edges change?
- A. vertex, edges
- B. vertices, edge
- C. vertices, edge
- D. vertex, edge