(a) Prove that if a connected planar graph has 13 vertices and 12 edges then it must be a tree. (b) Prove that any connected graph with n vertices has at least n-1 edges.

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
icon
Concept explainers
Topic Video
Question

Do fast...make sure answer is correct...thanks 

(a) Prove that if a connected planar graph has 13 vertices and 12 edges then it must be a tree.
CO
(b) Prove that any connected graph with n vertices has at least n-1 edges.
Transcribed Image Text:(a) Prove that if a connected planar graph has 13 vertices and 12 edges then it must be a tree. CO (b) Prove that any connected graph with n vertices has at least n-1 edges.
Expert Solution
steps

Step by step

Solved in 3 steps with 3 images

Blurred answer
Knowledge Booster
Application of Algebra
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, geometry and related others by exploring similar questions and additional content below.
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