Розмір відео: 1280 X 720853 X 480640 X 360
Показувати елементи керування програвачем
Автоматичне відтворення
Автоповтор
you are amazing ma'am! THANK YOU SOOOOOOOOOOOOOOOOOOOOOOO MUCH!
Justtt wowwwwwwww mam ❤
🎉🎉🎉 thanks for the information ℹ️ mam
Nice 👍 explanation mam...I seen other vedios but the solution is so lengthy 😢....but it was short and very understandable what u have explained tq❤
But it is only for complete graph not for all simple graphs because if the number of vertices is 4 like a rectangle then by the formula we have 6 edges but here we have only 4 edges. So please solve my problem.
The statement is maximum number of edges is n(n-1)/2... This means any simple graph with 4 vertices can have maximum 6 vertices
@@engineeringmathematics9006 ok thank you
Mam totally how many theorems are there in this chapter Only 6 theorems(or) is there any other.....
For disconnected graph also same aa
Yes
Indha question la n(n-1)/2 nu iruku but different ah indha question (n-1)(n-2) /2 nu irundha epdi mam pannanu
Whether the graph Has n-1 vertices?
Yes mam..
Tomorrow sem unga videos la indha sum illa ..epdi solve panrathu therla mam
@@Faiz-dn1xtuse the same proof.. finally replace n by n-1.. bcz n or n-1, it's just a number
Yeah mam but enaku idha hand shaking theorem use panni prove panna sollirukanga
Intha method mattum than solve panna mudiyuma
Very useful mam
Can I used for this method for i vertices instead of n vertices
Yeah sure... In the place of n replace by i
R-2021 ku discrete mathematics important questions post Pannuga mam ❤️
DISCRETE MATHEMATICS IMPORTANT QUESTIONS: ua-cam.com/play/PLuwKjRfi2s1Vwy1-Kt_ZaIQ3UWXyo2wtz.html
Sathish🤔
Thank you mam
you are amazing ma'am! THANK YOU SOOOOOOOOOOOOOOOOOOOOOOO MUCH!
Justtt wowwwwwwww mam ❤
🎉🎉🎉 thanks for the information ℹ️ mam
Nice 👍 explanation mam...I seen other vedios but the solution is so lengthy 😢....but it was short and very understandable what u have explained tq❤
But it is only for complete graph not for all simple graphs because if the number of vertices is 4 like a rectangle then by the formula we have 6 edges but here we have only 4 edges. So please solve my problem.
The statement is maximum number of edges is n(n-1)/2... This means any simple graph with 4 vertices can have maximum 6 vertices
@@engineeringmathematics9006 ok thank you
Mam totally how many theorems are there in this chapter
Only 6 theorems(or) is there any other.....
For disconnected graph also same aa
Yes
Indha question la n(n-1)/2 nu iruku but different ah indha question (n-1)(n-2) /2 nu irundha epdi mam pannanu
Whether the graph Has n-1 vertices?
Yes mam..
Tomorrow sem unga videos la indha sum illa ..epdi solve panrathu therla mam
@@Faiz-dn1xtuse the same proof.. finally replace n by n-1.. bcz n or n-1, it's just a number
Yeah mam but enaku idha hand shaking theorem use panni prove panna sollirukanga
Intha method mattum than solve panna mudiyuma
Very useful mam
Can I used for this method for i vertices instead of n vertices
Yeah sure... In the place of n replace by i
R-2021 ku discrete mathematics important questions post Pannuga mam ❤️
DISCRETE MATHEMATICS IMPORTANT QUESTIONS: ua-cam.com/play/PLuwKjRfi2s1Vwy1-Kt_ZaIQ3UWXyo2wtz.html
Sathish🤔
Thank you mam