28. Connectivity-Vertex & Edge Connectivity

[@karthikmaths4175]

Clear explanation in correct way.
Thank you madam.

[@parikshitsingh3595]

Look at her explanatory skill❤️❤️Thankyou so much

[@mathcivilians]

i watched this vedio at 3:12 AM just before the exams alone in a room . and this video scared me by its background sound of knock knock😱😱 >>>TRUE STORY BASED

[@daulathpaiyale2970]

much easier to understand ka...good teaching

[@RimshaShahazadi0]

I clearly understood this vedio wonderful mam And thank u so much for us teach

[@selvaram6357]

Super ma'am..thank s u a lot..clear explanation and example..this is what I neede

[@hirahira8457]

verrrrryyyyyyyyy nice video now I can understand this topic

[@Danny-007]

Congrats 🎉🎉

[@rishabhnegi479]

badiya,,, ab parti de!!!!!

[@deepadevraj865]

Very nice speech and presentation

[@aswinkumar7525]

Mam please continue to post videos in English it will be usefull for all students around the country

[@rishabhnegi479]

chall naa baap ko mat sikha.......

[@sasipriya4767]

Mam can u tell about 1- connected, 2- connected,3- connected graphs

[@MrZX-li9fh]

First our country then other 😄😄🤣

[@pratikbari1714]

Thanks 😊 mam for your lectures

[@madhukiranattivilli2321]

Do u mean bridges & articulation points?

[@shahzadameen6471]

Agr k(G) = 2 ho tu vertex connectivity k liyai kaisa graph banayain gai

[@supriya.hbutte5]

What are neighbour Degree connectivity indices.

[@unlimited.war_10.13]

Watching at 1 am before the exam 😅

[@samreensultana9224]

Ma'am Very helpful video and
Nice explanation

[@fathimakathar3619]

Perfect explanation mam...thanks a lot

[@AadeshingaleOfficial-zl5fd]

Nice Mam 😊

[@perumalmani9268]

I clearly understand u r session Mam..tq

[@rishabhnegi479]

thanks

[@rahulchaubey8988]

If graph is disconnected then vertex connectivity is minimum no. of vertices whose removal increases the number of component in the Graph.

[@ayeshaanwar4082]

thanku so much mam

[@Gandhiboy]

Thank you so much ❤️

[@mohammadafaqmir4117]

Mam give the proof vertex connectivity is less than Or equal to edge connectivity

[@prathameshyadav7968]

thank you

[@shrutimishra1396]

In graph G3 both ac and bc are bridge as on removal of these edges the graph become disconected ..then the edge connectivity will be 1 as u mentioned in the last if the edge is bridge then connectivity =1? But u write it 2 .. Don't understand help mam

[@itechnica]

As ac & bc are the edges not a bridge. Because only one single edge is a bridge at a time. If we remove one of the edge i.e ac or bc one at a time still we can reach to any vertex.
So after removing ac & bc the graph is disconnected, then edge connectivity=2.

[@shrutimishra1396]

@@itechnica thank u so much mam

[@akakop]

will b-----d edge can also be counted/taken for disconnecting graph?

[@itechnica]

In Graph G1????

[@akakop]

@@itechnica yes ..

[@itechnica]

Yes, u can also consider bd to make a graph disconnected.

[@gotangky]

You save me i love your math thx XD

[@ranjeetrout5816]

QUESTION: why the vertex connectivity of a graph never exceeds the edge connectivity?

[@harshithakeerti]

When you remove an edge vertex is not removed but when you remove a vertex you remove all connected edges.we want minimum no of edges and vertices to be removed obviously so we don't want a greater vertex connectivity.

[@shivambhirud8308]

Ma'am how many maximum vertex connectivity possible in a complete graph. N-1 or N -2?

[@itechnica]

max vertex connectivity possible is floor function of 2e/n.

[@shivambhirud8308]

@@itechnica thank you so much ma'am

[@mathlover12345]

I love you mam for your wonderfull videos.
It's because of you I am able to understand the concepts of this chapters.
Please mam make more videos on this subject(GRAPH THEORY)

[@s.kowsalyasathasivam7678]

Connectivity in fuzzy graph example venum

[@SaurabhKumar-lu7su]

What is the vertex connectivity of a disconnected graph?

[@nsarda]

0..i guess

[@BoomcoreIsLive]

There is no vertex connectivity and edge connectivity for disconnected graph.

[@sirajasafiq4617]

Mam put video for this question
Construct a graph G with the following properties
Edge connectivity of G=4, vertex connectivity of G=3 ,and degree of every vertex of G>=5.

[@dr.r.thayalarajan4189]

Good morning mam pls teach matching in graph theory

[@wakh999]

lov u thx

[@shrutiganesh4325]

Super mam sema

[@baderalhinai9717]

thank u i love u

[@pradeepkumarsingh6964]

Thnk u

[@subhajitmandal7576]

good jod.

[@ILikeItPicasso]

super

[@khadijamuzaffar4209]

Show that, if G is a connected graph with minimum degree k, then (G) ≤k
(ii) Draw a graph G with minimum degree k for which (G)

[@khadijamuzaffar4209]

Solve this question plz

[@sultanaalhindas3961]

I love you

[@amritrani4117]

Mam English K sath hindi mein bhi bol diya kro baki lecture smaj mein aa gya thinly😇

[@pramodkumarsingh8866]

G and unless ghab

[@naveen1343]

Good video, but used Gel/Ink pen for seen clearly...

[@Squish888]

I wish I had your penmanship.

[@rishabhnegi479]

abey chal naaaa

[@AnkitAnkitrao-us2nd]

Har har mahadev

[@gunijabrahma1123]

Mem please prove this question _ Show that the vertex connectivity of any graph G is always less than or equal to edge connectivity of G.

[@SACHINSINGH-re5ft]

3:11 is so funny

[@asbausmuhammad7596]

Smjhati achi ho lekn hindi m bola kre

[@mixichip]

you have lovely nails

[@rishabhnegi479]

chall bhaaggg