Graph Theory: 43. Havel-Hakimi Theorem on Graphical Sequences

Описание к видео Graph Theory: 43. Havel-Hakimi Theorem on Graphical Sequences

In this video I provide a proof of the Havel-Hakimi Theorem which gives a necessary and sufficient condition for a sequence of non-negative integers to be graphical (ie to be a degree sequence for some graph).
--Bits of Graph Theory by Dr. Sarada Herke.



Links to the related videos:
   • Graph Theory: 42. Degree Sequences an...   - Graph Theory: 42. Degree Sequences and Graphical Sequences
   • Graph Theory: 05. Connected and Regul...   - Graph Theory: 05. Connected and Regular Graphs

For quick videos about Math tips and useful facts, check out my other channel
"Spoonful of Maths" -    / spoonfulofmaths  

Комментарии

Информация по комментариям в разработке

Похожие видео