Draw an undirected graph that has exactly 11 edges and at least 5 vertices, in which two of the vertices have degree exactly 4, three of the vertices have degree exactly 3, and all other vertices have degree at most 2. Use as few vertices as possible and prove that you cannot use fewer vertices.

Elementary Geometry For College Students, 7e
7th Edition
ISBN:9781337614085
Author:Alexander, Daniel C.; Koeberlein, Geralyn M.
Publisher:Alexander, Daniel C.; Koeberlein, Geralyn M.
ChapterP: Preliminary Concepts
SectionP.CT: Test
Problem 1CT
icon
Related questions
Question
Draw an undirected graph that has exactly 11 edges and at least 5 vertices, in which two of the vertices have
degree exactly 4, three of the vertices have degree exactly 3, and all other vertices have degree at most 2.
Use as few vertices as possible and prove that you cannot use fewer vertices.
Transcribed Image Text:Draw an undirected graph that has exactly 11 edges and at least 5 vertices, in which two of the vertices have degree exactly 4, three of the vertices have degree exactly 3, and all other vertices have degree at most 2. Use as few vertices as possible and prove that you cannot use fewer vertices.
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Recommended textbooks for you
Elementary Geometry For College Students, 7e
Elementary Geometry For College Students, 7e
Geometry
ISBN:
9781337614085
Author:
Alexander, Daniel C.; Koeberlein, Geralyn M.
Publisher:
Cengage,
Elementary Geometry for College Students
Elementary Geometry for College Students
Geometry
ISBN:
9781285195698
Author:
Daniel C. Alexander, Geralyn M. Koeberlein
Publisher:
Cengage Learning