Graph Theory #16: Cut Set | Cut Vertex | Articulation Point | Cut Edge | Edge & Vertex Connectivity

[@yogeshborhade5533]

Thanks nicely explained. I watched it at 0.75x 😁. 🙏🙏🙏👍

[@avinashgupta2308]

2x pe dekho mazaa aayega

[@zuhaibhanfi6078]

@@avinashgupta2308 bhai 1.5 per best h

[@codeTuber033]

thank you sirjii......finally understood this concept which took me more than 10 reading still did not understand .....but in your one video its crystal clear.

[@pixabey900]

Sir your video was very helpful for me...thnx

[@sunainasharma5583]

Mje bhot ache se smj me aya😍. Lkn aapki speed🙏😅😅

[@Gurmeet183]

Muje lga ki Maine speed fast ki hai 2x 😂😂jab aapka comment pda aur speed check ki Maine toh muje pta chla ki sir ki khud ki speed thi 2x 😂😅😅😅

[@sunainasharma5583]

😅😅

[@adityasai550]

helpful before exam thanks

[@AditiSingh-ff7cf]

You maked it so easy

[@user-guzel-kiz]

Super sir thank you,☺️

[@rupeshthakur3754]

Video slow Karke dekhna para.. but helpful ❤️

[@abdulbasitkhan6012]

Wonderful

[@sapnasahu8516]

Thank you for the wonderful explanation

[@vinaymishra12]

Thanks sapna❤ Do subscribe for more learnings.

[@romikabansal4524]

Best lecture

[@336_saranyamaity8]

10:37 the 2nd ( cant make the graph disconnected ) and 3rd example IS NOT CUT SET

[@ThomasPhilip104]

yea

[@humanAbsu]

yes

[@arman9957]

yes

[@ch.s.s.ktejaswini185]

Sir please solve this problem Draw a graph with edge connectivity 4 vertex connectivity 3 and degree of every vertex is greater than or equal to 5

[@sanjeevprasad1705]

Awesome work❤️

[@saklinsk4618]

Thank you, sir. 😊
.
..
...

[@devlowanshi3820]

Thanks a lot sir

[@pu4425]

great man

[@subhamkumarsah7885]

Can you please cover the whole syllabus of GT

[@vinaymishra12]

Covered more than 95%

[@336_saranyamaity8]

sir , i have a doubt , lets say i have graph of only 2 vertex , and they are connected by 1 edge , now here cut edge exists but cut vertex does not exist because a single vertex is also considered as connected graph , now how we can related this to the given property ?

[@babitamohalik3448]

Both vertices are cut vertex as deleting one of the two vertices will also delete the edge connected to it.....so only one vertex will remain....but here u will get only one part of the whole graph... 🙂...in other examples we r getting 2 parts after disconnection.

[@af_pigeons_]

Bhaiya thoda shant se bolo panvel nahi nikal na hai 😂

[@lakshyagupta9435]

please explain slowly

[@shabnamjahan2704]

Bhai sans dheere lo Zara 😁😆

[@ziauddin1331]

Ap agr video banaya tu ap speed ko tora sa kam kara sorry for that sir

[@fakhardilshad2717]

Sir Thoda relax ho Kay smjhaya kray

[@anuradhabhardwaj7047]

Helpful.... Par chilla kahe rhe ho

[@pulakkundu6608]

need your slow talk sir

[@bollywoodjello5586]

Take a break bro your girlfriend will be there she doesn’t goes to anywhere 😂😂

[@pritihooda8731]

Speed km please sir vasie SMj aagya

[@samarthmalhotra7951]

Your second cut set is wrong.

[@vagmarerishikesh2903]

E kya hai?

[@mousaalbalawi291]

You so fast 😅

[@AJ-ls9ey]

bhaii teri train chuthri tu vo pkd le ham padh lenge

[@carlosgarcia6745]

you seem stressed