Video_17: A graph is disconnected if and only if its vertex set can be partitioned into two sets

Описание к видео Video_17: A graph is disconnected if and only if its vertex set can be partitioned into two sets

Proof for the following statements

A graph is disconnected if and only if its vertex set can be partitioned into two nonempty, disjoint subsets V_1 and V_2 such that there exist no edge in G whose one end vertex is in V_1 and other in V_2.


If a graph has exactly two vertices of odd degree, then they must be connected by a path.

Комментарии

Информация по комментариям в разработке

Похожие видео