Graph with Same Order and Size has One Cycle | Graph Theory

preview_player
Показать описание
A graph that has the same number of vertices as edges (same order and size) will have exactly one cycle. This result relies - unsurprisingly - on some results about trees, and we'll be proving it in today's graph theory video lesson!

I hope you find this video helpful, and be sure to ask any questions down in the comments!

+WRATH OF MATH+

Follow Wrath of Math on...

Рекомендации по теме
Комментарии
Автор

Do you plan on making Chrismas themed videos for next month?

APh_
Автор

How could I prove the converse? that is, if a connected graph has exactly one cycle then n=m

CrArKoLoNgAsO