Thanks a lot for watching Chian! Your comment cracked me up, but I’m sorry to hear your professor has not been making things clear! I hope my lessons will continue to be helpful!
Is it appropriate to consider E(H) as a subset of E(G) when defining a spanning subgraph? If E(H) happens to contain all the edges of G, won't it then become an improper subgraph?
Love this playlist of short, crisp bite-sized videos covering basics of graph-theory; kudos!. QUESTION on this video: The video appears to suggest that any subset of the edges in the original ghraph would make it a spanning sub-graph so long as all the vertices of the original graph are retained. I was under the impression that the edges must be such that every vertex that is reachable in the original graph must be reachable in the sub-graph for it to be a 'SPANNING' sub-graph. Am I mistaken?
Thank you! And from every source I can find, the definition I provide in this video is the one that is used. A spanning subgraph of G is a subgraph of G with the same vertex set as G.
You're welcome! Videos on topology will come in the future, but for this year my focus is on real analysis! I still have considerable studying to do myself for topology, so it will be a while unfortunately.
Sir if u have a solution manual for A First course in Graph Theory by Gary Chartrand and Ping Zhang It would be very helpful if u can By the way the videos are very useful Thank u for all that u are doing spreading ur knowledge
Thanks for watching and I am glad the videos have been useful! I do not have a solution manual for A First Course in Graph Theory, but I have many videos giving my own solutions to exercises from the text. If you have a particular problem from the text in mind, let me know and I can point you to, or possibly make a new lesson on it!
going to help so many students who are always rushed to do graph theory at the end of their classes during the semester!
Thank you, I hope it will!
thanks WoM. my professor is speaking Mars language, so I come here to listen to you.
Thanks a lot for watching Chian! Your comment cracked me up, but I’m sorry to hear your professor has not been making things clear! I hope my lessons will continue to be helpful!
this lecture is far better than my professor's lecture tbh
its precise and clear
Thanks so much, I'm glad it was helpful!
Out of curiosity, what is/was your degree and how are/were your studies going?
I feel a great relief during the 4 minutes...thank you so much
That song at the end is extremely soothing as well.
Thank you so much for this amazing explanation!
Glad it was helpful!
Is it appropriate to consider E(H) as a subset of E(G) when defining a spanning subgraph? If E(H) happens to contain all the edges of G, won't it then become an improper subgraph?
if so, then improper subgraph can be considered as a spanning subgraph?
What is connected Spanning subgraph? Do they have Cycles?
Spanning subgraph? More like "Superb knowledge transference; thanks for that!" 🙏
Most certainly helped
These are so helpful
Glad to hear it!
Love this playlist of short, crisp bite-sized videos covering basics of graph-theory; kudos!.
QUESTION on this video: The video appears to suggest that any subset of the edges in the original ghraph would make it a spanning sub-graph so long as all the vertices of the original graph are retained. I was under the impression that the edges must be such that every vertex that is reachable in the original graph must be reachable in the sub-graph for it to be a 'SPANNING' sub-graph. Am I mistaken?
Thank you! And from every source I can find, the definition I provide in this video is the one that is used. A spanning subgraph of G is a subgraph of G with the same vertex set as G.
that has special term for it, "spanning tree"
THANK YOU! I REQUEST YOU TO MAKE VIDEOS ON TOPOLOGY 😊🙏
You're welcome! Videos on topology will come in the future, but for this year my focus is on real analysis! I still have considerable studying to do myself for topology, so it will be a while unfortunately.
NO PROBLEM SIR , THANKS A LOT!😊
@@WrathofMath I appreciate you keeping it...real 😎
Amazing teacher ❤ 👏
If you wanted to determine how many isolated vertices H (the spanning subgraph) would have how would you do this?
Is original graph itself a spanning subgraph ?
Yes, I believe that is true.
does it still need to be connected?
Thanks for watching and nope, a spanning subgraph just has to be a subgraph with all vertices of the original graph - no other restrictions!
i hope my comments bring more attention to your page. it's a gem for sure
Sir, spanning subgraph has nothing to do with the edges right? Is it just the vertices?
That's right! Thanks for watching!
Your videos are really very helpful sir 👍🏽
Thanks !
No problem, thanks for watching!
excellent !!!
Thank you! :)
Sir if u have a solution manual for A First course in Graph Theory by Gary Chartrand and Ping Zhang
It would be very helpful if u can
By the way the videos are very useful
Thank u for all that u are doing spreading ur knowledge
Thanks for watching and I am glad the videos have been useful! I do not have a solution manual for A First Course in Graph Theory, but I have many videos giving my own solutions to exercises from the text. If you have a particular problem from the text in mind, let me know and I can point you to, or possibly make a new lesson on it!
thank you
You're very welcome and thank you for watching! Let me know if you ever have any video requests!
😊
👍🏻👍🏻👍🏻