Register

VCE Algorithmics (HESS) Practice Questions - VCE Algorithmics (HESS) Units 3 & 4 Exam

Access More Questions
A connected simple undirected graph G has 15 vertices. Five vertices have degree 4, four vertices have degree 3, and six vertices have degree 2. How many edges does G contain?
Correct Answer:
22 edges

Access more questions from this quiz

Continue to VCE Algorithmics (HESS) Practice Questions - VCE Algorithmics (HESS) Units 3 & 4 Exam for more practice questions and the full quiz experience.

Access More Questions