Strongly Connected Directed Graphs | Graph Theory, Digraph Theory
Vložit
- čas přidán 19. 05. 2024
- What are strongly connected digraphs? That's what we'll be going over in today's graph theory lesson. We'll recap connectedness, what it means to be weakly connected, and then finish off with the definition of strongly connected!
We say a directed graph D is strongly connected if, for every pair of vertices u and v in D, there is a u-v path and a v-u path, where the "paths" are directed. In other words, a directed graph D is strongly connected if every vertex is reachable from any other vertex.
Lesson on Connected graphs: www.youtube.com/watch?cv=z9cT...
Lesson on weakly connected digraphs: • Weakly Connected Direc...
Lesson on underlying graphs: • Underlying Graphs of D...
◆ Donate on PayPal: www.paypal.me/wrathofmath
◆ Support Wrath of Math on Patreon: / wrathofmathlessons
I hope you find this video helpful, and be sure to ask any questions down in the comments!
********************************************************************
The outro music is by a favorite musician of mine named Vallow, who, upon my request, kindly gave me permission to use his music in my outros. I usually put my own music in the outros, but I love Vallow's music, and wanted to share it with those of you watching. Please check out all of his wonderful work.
Vallow Bandcamp: vallow.bandcamp.com/
Vallow Spotify: open.spotify.com/artist/0fRtu...
Vallow SoundCloud: / benwatts-3
********************************************************************
+WRATH OF MATH+
Follow Wrath of Math on...
● Instagram: / wrathofmathedu
● Facebook: / wrathofmath
● Twitter: / wrathofmathedu
My Music Channel: / seanemusic
Awesome video cleared my doubt on the difference between a strongly connected graph and a connected graph.😊
Wrath of math is the best channel for mathematics videos on CZcams.. This playlist on graph theory helped me a lot sir.. Thank u so much 😇❣️
Thank you! Glad to help!
Had lot of Confusion b/w Weakly and Strongly connected graphs..
Now, Crystal Clear
Thanks for the Video.. ❤
Awesome - thanks for watching!
The best graph theory playlist.
Thanks Tamim, I really appreciate that! So glad it has been useful for you!
Binge watching the graph theory playlist because it makes more sense than my teacher binging topics at the speed of light. Thank you so much sir, your videos have been a great help. 🙌
Thank you for watching Simrat, so glad the lessons have been helpful! Been working on more graph theory lessons lately - let me know if you ever have any video requests, still a lot of work to do before the playlist is complete!
Thank you sir! I was very confused about this concept
So glad it helped! Thanks for watching, and check out my graph theory playlist if you're looking for more! czcams.com/play/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH.html
Ty very much, ur explanation is clear and to the point.
Glad to help!
Your videos are awesome!
Great video, thanks man!
No problem, thanks for watching!
This was very useful. many thanks for your effort
My pleasure, glad to help!
Thank you! This really helped me
I'm glad to hear it! You're welcome and thanks for watching!
"No hurricane or power outage is going to stop the math" - let's goooo
thank you sir.it helped me a lot in lockdown time
You're welcome! I'm glad it helped and thanks for watching!
Thanks for the hard work and effort you put into all your videos! Rain or shine indeed lol
It's my pleasure, thanks for your support, Barbora!
Thank you sir..Great work
My pleasure, thanks for watching!
Really great video! :)
Thanks, Kenil! Be sure to check out my graph theory playlist if you're looking for more lessons on the subject! czcams.com/play/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH.html It currently doesn't have a ton of material on directed graphs, but more is coming!
How to define graph connectivity of a directed graph? Ho do we define the directed graph is k-connected? And what would be the definition of vertex disjoint of a directed graph?
can you make a triple itegral video :( finding the bounds of integration in particular
can i get the name of the song at the end of vid, bro ?
Thank you 😊
Glad to help!
Can you explain what is condensation of a digraph?
thank you so much
No problem, thanks for watching!
Excellent sir
My pleasure, thanks for watching!
thanks you so much sir
You're very welcome! Thanks for watching and check out my graph theory playlist if you're looking for more: czcams.com/play/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH.html
Many more lessons on the way!
Thank you :D
My pleasure, thanks for watching! If you're looking for more graph theory, check out my playlist: czcams.com/play/PLztBpqftvzxWo4HxUYV58ENhxHV32Wxli.html
Can you make a video on ramanujan summation which states that sum of all real numbers is
1 + 2 + 3 + 4 + 5 ... = - 1/12
Thanks a lot 😍
No problem, thanks for watching! Check out my graph theory playlist if you're looking for more! czcams.com/play/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH.html
thank u so much
Happy to help!
Sir how you do that can you tell me
Sir I am understanding lesson very fast learner by your channel
So glad to hear it, thanks for watching! :)
@@WrathofMath sir please start inequalities chapter
I'd be happy to help, could you be more specific? What about inequalities would you like to learn? I already have a handful of lessons on graphing them and other things, but would be happy to do some more lessons on them if you have a specific topic in mind!
@@WrathofMath sir I am want if xbelongs to (2,5) then1/X belongs to
@@WrathofMath IAM sorry for late response
Good job
Thank you, Mohammed!
@@WrathofMath Your lessons are simple, clear, and well explained
I'm studying some mathematics for algorithms while watching them, keep going sir.
Me too sir thank u
Ur a legend
I do my best! Thanks for watching and let me know if you ever have any questions!
Please make a lesson on tournaments in graph theory.
Good idea, I have been meaning to do that for quite a while!
I've got more coming, but here is the intro lesson - hope you like it! czcams.com/video/LOFAR1SIqno/video.html
Matrix tree computation
what do you mean by a k-connected directed graph?
Give an example
Thanks for watching! I would mean a directed graph that is strongly connected and can only be made not so by removing at least k vertices. If D is a digraph and removing any four vertices of D still leaves it strongly connected, then D is 4-connected, and by definition it is also 3-connected, 2-connected, 1-connected, and 0-connected. It may also be 5-connected, but I haven't provided information to conclude that.
@@WrathofMath Thanks bro for answering. I had one more doubt Can you please answer? The doubt is : What is the difference between a minimum spanning tree and a minimal spanning tree of a graph?
Gr8
Your videos are awesome!
Thank you! My biggest video yet comes out next Tuesday, it's not a very mathy video - but it's a lot of fun!