Question

ret G a - be a connected graph. An edge e is called a cut-edge in G if G-e results in a disconnected graph. If every vertex of G has even degree, then G contains​

Answer 1

Answer:

Hope this helps you

mark as brillianest

Answer 2

Answer:

Let ‘G’ be a connected graph. A vertex V ∈ G is called a cut vertex of ‘G’, if ‘G-V’ (Delete ‘V’ from ‘G’) results in a disconnected graph. Removing a cut vertex from a graph breaks it in to two or more graphs.

Note − Removing a cut vertex may render a graph disconnected.

A connected graph ‘G’ may have at most (n–2) cut vertices.

Example

In the following graph, vertices ‘e’ and ‘c’ are the cut vertices.