*разделящ връх*

A vertex whose deletion along with incident edges results in a graph with more components than the original graph is called **cut vertex**.

*разделящ връх*

A vertex whose deletion along with incident edges results in a graph with more components than the original graph is called **cut vertex**.