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.😔
you explained this topic in a good way and your hand writing is very good
Maam ur lectures r very helpful to me the way u present it is convenient n make topic easy to understand
Thks dear after a lot of search I found the best explanation
love u man u videos help me a lot
Mam I think "f" if the cut vertex ... Mam what is the difference between bridge and edge connectivity??
Super explanation madam
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
Hi! yes u r right. If we remove vertex f then the graph is disconnected.
Mam cut vertex or cut set both exist at one time ?
very helpful... thanks a lot, u saved my time.
Keep making such videos.
GOOD LUCK
Excellent madam
Vry helpful thnkx God bless you
We can remove f also right it is cut vertex 4:20
Thankyou it is so helpful
very good
Diff between cut set and cut edge ??
cut set is a set of edges or vertices. and cut edge is what edges you cut out of the graph
Very helpful...
Thank mam...
Mam ur presentation good. I need vizing theorem , halls theorem
Please.....give an example of simple graph....like C6 and wheel graph
Plz send me the link of video in which u explain about component????
Hi! Kindly watch video no 5 in Graph Theory playlist for topic component.
@@itechnica video 5 is about connected and disconnected graphs....not about components..??
@@kashfgfar9957 kindly watch the full video.
@@itechnica there is no proper definition of component...
@@kashfgfar9957 component is a sub parts of a graph or subgraph. Disconnected graph has more than one component.
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.😔
Cut -vertix of K5
why d,e is not cut vertices?
Sushila Pandey Hi! Yeh d,e are also cut vertex. There are more than one cut vertex in a graph. Thankd
@@itechnica if we remove vertex f in Ex. It became also disconnected
1) part a,b,d,c,e (2) part only vertex h.
Remove f vertex in it ...
Nice explaination but so irritating voice.. 🤣sorry!
Ary esy mat bolo