Tree and Forest in Graph Theorem | Theorem 9.1 in chapter 4 (Trees) || Book Robin J. Wilson

preview_player
Показать описание
In this video we define Trees and Forest in Graph theory Also we discuss their related theorem
Theorem 9.1
Let T be Graph with n vertices. Then the following statements are equivalent.
1- T be a tree
2- T contains no cycle, and has n-1 edges
3- T is connected and has n-1 edges
4- T is connected and each edge is a bridge
5- any two vertices of T are connected by exactly one path
6- T contains no cycle but the addition of any edge creates exactly one cycle

#Theorem9.1
#Tree&Forest
Рекомендации по теме
Комментарии
Автор

So useful video everything is clear by the end of the video Mashallah keep it up teacher

khadijasyed
Автор

Mam es chapter Kee exercise nai krwye apny?

aliusmansahib
Автор

Mam ...y lecs playlists m nh hn ...kindly arrange krlem playlist

bunnygamers
Автор

Mam jee 4 chapter sy agye sub ke exercise bhi krwa dye plzz

badarhabib
Автор

sorry to say that
mam please learn first and then teach

muslimisticvedios
Автор

Mam es chapter Kee exercise nai krwye apny?

aliusmansahib