27. Cut vertex /Cut Set/Bridge

This Video explain about cut vertex/ cut point, cutset and bridge.
_________________________________________
You can also connect with us at:
Website: www.itechnical...
Facebook: / itechnica.learning.3
Twitter: / itechnicalearn1
Instagram: / itechnicalearning

[@hirahira8457]

you explained this topic in a good way and your hand writing is very good

[@c3saniashaheen543]

Maam ur lectures r very helpful to me the way u present it is convenient n make topic easy to understand

[@Vyola08]

Excellent madam

[@ajayswargiary1749]

Mam I think "f" if the cut vertex ... Mam what is the difference between bridge and edge connectivity??

[@harpreetkamboj9959]

Thks dear after a lot of search I found the best explanation

[@yasithadhananjaya8365]

very good

[@vinayande7698]

love u man u videos help me a lot

[@prasadkirapatla3539]

Super explanation madam

[@Riyad355]

If we remove f vertex then it will be a disconnected graph. But you said there is no single vertex to
disconnect the graph...why? please explain

[@itechnica]

Hi! yes u r right. If we remove vertex f then the graph is disconnected.

[@shaikhaabida8723]

Mam cut vertex or cut set both exist at one time ?

[@hamzashahbaz6471]

Cut -vertix of K5

[@azwershah7819]

Vry helpful thnkx God bless you

[@intannidzar7684]

Thankyou it is so helpful

[@shreyasjain4all]

very helpful... thanks a lot, u saved my time.
Keep making such videos.
GOOD LUCK

[@soumadipbanerjee3959]

Very helpful...
Thank mam...

[@deepadevraj865]

Mam ur presentation good. I need vizing theorem , halls theorem

[@kumailali5491]

Please.....give an example of simple graph....like C6 and wheel graph

[@tempgmail6137]

Diff between cut set and cut edge ??

[@jaminabegum123]

cut set is a set of edges or vertices. and cut edge is what edges you cut out of the graph

[@rajdipshil3332]

Mam i dont find topic =("1,Sequential representation of graphs.2,Linked representation of graphs .3,Traversal of graphs.4,Shortest path.5,Shortest path algorithm.6,Dijkstra,s algorithm.7,Floyd-Warshall algorithms.8,BFS ,DFS algorithm.)...Help me..i need your suggestion. .plssss.😔

[@riteshsingh7179]

Remove f vertex in it ...

[@kashfgfar9957]

Plz send me the link of video in which u explain about component????

[@itechnica]

Hi! Kindly watch video no 5 in Graph Theory playlist for topic component.

[@kashfgfar9957]

@@itechnica video 5 is about connected and disconnected graphs....not about components..??

[@itechnica]

@@kashfgfar9957 kindly watch the full video.

[@kashfgfar9957]

@@itechnica there is no proper definition of component...

[@itechnica]

@@kashfgfar9957 component is a sub parts of a graph or subgraph. Disconnected graph has more than one component.

[@sushilapandey8250]

why d,e is not cut vertices?

[@itechnica]

Sushila Pandey Hi! Yeh d,e are also cut vertex. There are more than one cut vertex in a graph. Thankd

[@sandippankhaniya915]

@@itechnica if we remove vertex f in Ex. It became also disconnected
1) part a,b,d,c,e (2) part only vertex h.

[@riturajpathak1905]

Nice explaination but so irritating voice.. 🤣sorry!

[@c2djourney70]

Ary esy mat bolo