Download presentation

Presentation is loading. Please wait.

Published byAngelica Aycock Modified over 3 years ago

1
Simple Graph Warmup

2
Cycles in Simple Graphs A cycle in a simple graph is a sequence of vertices v 0, …, v n for some n>0, where v 0, ….v n-1 are distinct, v 0 =v n, and {v i,v i+1 } is an edge for 0≤i

3
Trees A tree is a connected acyclic graph. (These are a kind of undirected graph, so the definition is different from the directed trees we talked about earlier.)

4
In a tree there is a unique path between any pair of vertices Proof. If there were two vertices with no path between them, the graph would not be connected. Suppose there were two vertices with two distinct paths between them. By the WOP there would be a shortest possible path in the graph for which there is a distinct path between the same pair of endpoints. The second path must have no vertices in common with the first except the endpoints (otherwise first path would not be the shortest). Then following one path forward and the other back creates a cycle, contradiction. So there cannot be more or less than one path between any pair of vertices. QED.

5
Finis

Similar presentations

OK

Data Structures Chapter 12 Graphs Andreas Savva. 2 Definition A graph consists of a set of vertices together with a set of edges. If e = (v,w) is an edge.

Data Structures Chapter 12 Graphs Andreas Savva. 2 Definition A graph consists of a set of vertices together with a set of edges. If e = (v,w) is an edge.

© 2018 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on models of marketing communication Ppt on hybrid renewable energy systems Ppt on bharatiya janata party Ppt on cloud computing free download Ppt on minimum wages act 2015 Ppt on life insurance corporation of india Free ppt on french revolution Ppt on types of houses around the world Ppt on polynomials download games Ppt on different solid figures in geometry