No problem! Thanks for watching and check out my Graph Theory playlist for more if you haven't already! ua-cam.com/play/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH.html
@@WrathofMath sir in the previous lecture comments I had asked question from U That how to draw spanning trees of Cube Q3? Sir please🙏 answer my this question my exams are quite near
For future viewers: the vertex connectivity is K(G) or otherwise known as the min vertex cut. K-connected graph defines a lower bound for k. For example say a graph is has K(G)=2. Then it would be 2 connected as there exists a cut with 2 vertices s.t. the graph will be disconnected. Then it would surely also be 3-connected because it is 2-connected. It just states the lower bound for k in how many vertices we remove to form a minimum vertex cut.
My pleasure, thanks for watching! If you're looking for more graph theory, check out my playlist! ua-cam.com/play/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH.html
Your lectures are the most underrated...it's absolute best for noobs
Ya.
I really appreciate that, Nipun! Thanks for watching!
Vertex-connectivity? More like "Very good videos? Yes indeedy!" 👍
Thank you so much!
You're welcome, thanks for watching!
Its really use full... Am from Kerala, india
Glad to hear it, thanks for watching! Much love from the USA!
Thanks for this.
Super class sir.Everything is clear
Glad to hear it, thanks a lot for watching!
is the vertex-connectivity of the graph at the end 4 ?
its 3
@@msbrdmr I'm pretty sure it's 4, what 3 do you remove?
@@jschoete3430 My bad, its 4 as minimum number of vertices to be removed.
Many many thanks 😊😊
No problem! Thanks for watching and check out my Graph Theory playlist for more if you haven't already! ua-cam.com/play/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH.html
Very good 👍👍explanation sir
Keep it up🌹🌹
God bless you for your efforts 🌺🌺🌺
Thank you very much! Let me know if you ever have any questions, and I am glad you found this lesson clear!
@@WrathofMath sir in the previous lecture comments
I had asked question from U
That how to draw spanning trees of Cube Q3?
Sir please🙏 answer my this question my exams are quite near
Thanks for reminding me, Ali! I'm not sure I understand the question. Are you asking how many spanning trees Q3 has?
@@WrathofMath yes
But my question is...
Draw 2 spanning trees of Cube Q3.
I get confused after watching this video, then what is the difference between vertex connectivity and the definition of k-connected graph?
For future viewers: the vertex connectivity is K(G) or otherwise known as the min vertex cut. K-connected graph defines a lower bound for k. For example say a graph is has K(G)=2. Then it would be 2 connected as there exists a cut with 2 vertices s.t. the graph will be disconnected. Then it would surely also be 3-connected because it is 2-connected. It just states the lower bound for k in how many vertices we remove to form a minimum vertex cut.
So good
Thank you!
hi iam new in this channel ..great videos .. so usefull... one question what is the board u r using? .... greetings from colombia
Thanks a lot! I am using the software Notability on iPad Pro!
thks
My pleasure, thanks for watching! If you're looking for more graph theory, check out my playlist! ua-cam.com/play/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH.html
{a, b, f, e}