What are Non-Separable Graphs? | Graph Theory
ฝัง
- เผยแพร่เมื่อ 13 ก.พ. 2020
- What are non-separable graphs? To understand non-separable graphs, we need to understand cut vertices. A vertex of a graph is a cut vertex if deleting it disconnects the graph or the component the vertex belongs to.
Here is my lesson on cut vertices: • What is a Cut Vertex? ...
A non-trivial connected graph is non-separable if it contains NO cut vertices, so deleting any vertex from the graph will not disconnect it. We may be able to disconnect the graph by deleting two vertices, but never by deleting just one. This touches on the idea of vertex connectivity, here is my lesson on that: • Vertex Connectivity of...
Alternatively, if you are familiar with vertex cuts, a connected nontrivial graph is nonseparable if it contains no vertex cuts of cardinality 1. Here is my lesson on vertex cuts: • Vertex Cuts in Graphs ...
The following theorem characterizes non-separable graphs.
A graph with at least 3 vertices is non-separable if and only if every two vertices of the graph lie on a common cycle.
I hope you find this video helpful, and be sure to ask any questions down in the comments!
+WRATH OF MATH+
◆ Support Wrath of Math on Patreon: / wrathofmathlessons
Follow Wrath of Math on...
● Instagram: / wrathofmathedu
● Facebook: / wrathofmath
● Twitter: / wrathofmathedu
My Music Channel: / seanemusic
Non-separable graphs? More like "Nice videos that're the best!" 👍
Why do i fall in love right before my exams?
Emotions are always high before exams 😂 I hope they went/are going well!
THANK YOU SO MUCH. Your videos are amazing and super easy to follow+understand.
You're very welcome! I am glad it helped and thanks for watching! Let me know if you ever have any questions!
Thank you so much this helped a lot
So glad it helped, thanks for watching!
Thank you for this video and i hope you make a video that explains MINTY's lemma (in
graph theory) and i'll be sooo glade
You're welcome and thanks for watching! I don't think I have heard of Minty's Lemma, or at least I have not heard of a lemma referred to as "Minty's Lemma". What does it state? I'd be happy to do look into it and possibly do a lesson on it!
Is another way of putting this that there is at least one spanning subtree that is isomorphic to Cn (where is is the number of vertices)?
Can you Pls explain the theorem ...
Thanks for watching, which theorem do you mean?
@@WrathofMath theorem that you've written on the board at the end of the video...
Please sir tell title of book and if you have share it.
First Course in Graph Theory by Chartrand and Zhang!
Hi Your videos are great, May I know your name and if you are a professor in a university(is it possible to participate in any research work of yours)? Thanks
where is the proof :(. have exams tomorrow
How'd your exams go?