Download presentation

Presentation is loading. Please wait.

1
Can Dijkstra’s Algorithm be modified in an obvious way to give the longest path in a graph? a). Yes b). No c). I have absolutely no idea

2
What is k(2K 3 N 3 )? 1 23456789

3
a b c d e f g h j i k m l p o n What is d(c,j)? 12345678

4
a b c d e f g h j i k m l p o n What is diam(G)? 1). 12). 23). 44). 5 5). 76). 87). 98). 10 9). 1110). 13

5
Given the statement of this theorem, which of the following are possible? 1). G and are both connected. 2). G and are both disconnected. 3). One is connected and one is disconnected. 4). 1 and 2 are possible. 5). 1 and 3 are possible. 6). 2 and 3 are possible. 7). All three are possible.

6
What is the first line of the proof? 1). Assume G is disconnected. 2). Assume is connected. 3). Assume if G is disconnected, then is connected. 4). Assume G and are connected.

7
What is the second line of the proof? 1). Assume there is a u-v path in G. 2). Assume is connected. 3). Assume if G is disconnected, then is connected. 4). Assume G and are connected. 5). Let u and v be any two vertices in.

8
a b c d e f g h j i k m l p o n How many cut-vertices does G have? 12345678

9
a b c d e f g h j i k m l p o n How many bridges does G have? 12345678

10
How many bridges does P 6 have? 12345678

Similar presentations

© 2022 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