a) Consider the following graph: How many edges must we remove to obtain a spanning tree?

Elementary Geometry For College Students, 7e
7th Edition
ISBN:9781337614085
Author:Alexander, Daniel C.; Koeberlein, Geralyn M.
Publisher:Alexander, Daniel C.; Koeberlein, Geralyn M.
Chapter2: Parallel Lines
Section2.5: Convex Polygons
Problem 41E
icon
Related questions
Question

need help with hw questions

a) Consider the following graph:
How many edges must we remove to obtain a spanning tree?
b) True or false?
Any simple graph with 4 vertices and 3 edges is a tree
OTrue
Every connected graph has a spanning tree
O True
Every tree has a vertex of degree < 1
Ofrue
OFalse
OFalse
OFalse
A planar drawing of a graph G has four faces, whose degrees are 3, 4, 5 and 8 respectively.
How many edges does the graph have?
How many vertices does the graph have?
Transcribed Image Text:a) Consider the following graph: How many edges must we remove to obtain a spanning tree? b) True or false? Any simple graph with 4 vertices and 3 edges is a tree OTrue Every connected graph has a spanning tree O True Every tree has a vertex of degree < 1 Ofrue OFalse OFalse OFalse A planar drawing of a graph G has four faces, whose degrees are 3, 4, 5 and 8 respectively. How many edges does the graph have? How many vertices does the graph have?
Expert Solution
steps

Step by step

Solved in 3 steps with 3 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,