Download presentation

Presentation is loading. Please wait.

Published bySebastian Sinclair Modified over 3 years ago

1
The Havel-Hakimi Algorithm

2
Take as input a degree sequence S and determine if that sequence is graphical That is, can we produce a graph with that degree sequence?

3
Assume the degree sequence is S Note: steps 1 and 2 are a pre-process

4
S = 4,3,3,3,1

5
S = 2,2,2,0

6
S = 4,3,3,3,1 S = 2,2,2,0S = 1,1,0

7
S = 4,3,3,3,1 S = 2,2,2,0S = 1,1,0S = 0,0

8
S = 4,3,3,3,1 S = 2,2,2,0S = 1,1,0Report Success

9
4,4,4,4,1,1,1,1,1,1,1,1,1,1

10
Alternatively 4,4,4,4,1,1,1,1,1,1,1,1,1,1

11
Havel-Hakimi produces the following 4,4,4,4,1,1,1,1,1,1,1,1,1,1 The hypothetical hydrocarbon Vinylacetylene

12
So? (the question from hell) Well, we have demonstrated that the HH algorithm doesnt always produce A connected graph. We have also shown that by representing molecules as simple graphs and using an algorithm to model this graph we might get some unexpected results, maybe something new!

Similar presentations

Presentation is loading. Please wait....

OK

Flow Charts WHAT ARE THEY AND WHY DO WE USE THEM?.

Flow Charts WHAT ARE THEY AND WHY DO WE USE THEM?.

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on marie curie high school Ppt on central excise duty Ppt on synthesis and degradation of purines and pyrimidines structure Download ppt on phase controlled rectifier Ppt on dispersal of seeds by animals puzzle 360 degree customer view ppt on mac Make a ppt on unity in diversity and organic farming Ppt on different occupations in nigeria Ppt on new zealand cultures Ppt on water softening techniques