Proof of a Characterization of Cut Vertices | Graph Theory

preview_player
Показать описание
A vertex v, of a connected graph G, is a cut vertex if and only if there exist two vertices u and w - distinct from v - such that every u-w path in G contains v. We'll be proving this characterization of cut vertices in today's video graph theory lesson!

The second direction is to assume that v is a vertex of G that lies on every u-w path for two vertices u and w, neither equal to v in G. Then we show v must be a cut vertex of G by analyzing the graph G-v, which clearly cannot have a u-w path. Thus G-v must be disconnected, so v is a cut vertex.

I hope you find this video helpful, and be sure to ask any questions down in the comments!

+WRATH OF MATH+

Follow Wrath of Math on...

Рекомендации по теме
Комментарии
Автор

Characterization of cut? More like "Cool videos that can help get you out of a rut!" 👍

PunmasterSTP
Автор

Could you also explain algorithm to find out cutvetex and bridges in a graph? Thanks

LearningCS-jpcb
Автор

could you make video to proof menger's and whitney's theorem and Tree characterizations theorem.

rafiqulislam
Автор

please can you help me by how i can find cut vertex by DFS algorithm?

saifalisaif