Download presentation

Presentation is loading. Please wait.

1
What is the next line of the proof? a). Let G be a graph with k vertices. b). Assume the theorem holds for all graphs with k+1 vertices. c). Let G be a graph with k+1 vertices. d). Assume the theorem holds for all graphs with k-1 vertices. e). Let G be a graph with k-1 vertices.

2
What is the next line of the proof? a). Add a vertex to G to create G’. b). Delete a vertex from G to create G’. c). Add an edge to G to create G’. d). Delete an edge from G to create G’.

3
How many different spanning trees does the given graph have? a). 0 b). 1 c). 2 d). 3 e). 4 f). 5 g). 6 h). 7 i). 8

4
Is K 4 planar? a). Yes b). No c). I have absolutely no idea

5
Is K 2,3 planar? a). Yes b). No c). I have absolutely no idea

6
Is K 5 planar? a). Yes b). No c). I have absolutely no idea

7
Is K 3,3 planar? a). Yes b). No c). I have absolutely no idea

Similar presentations

© 2019 SlidePlayer.com Inc.

All rights reserved.

To make this website work, we log user data and share it with processors. To use this website, you must agree to our Privacy Policy, including cookie policy.

Ads by Google