Can you prove it by using counter example please Prove or di

Can you prove it by using counter example please

Prove or disprove: If G is a connected graph with cut-vertices and u and v are antipodal vertices of G, then no block of G contains both u and v.

Solution

prove and disprove

For a counter example, consider the graph G obtained from K4

by
deleting an edge, and let u; v be the two vertices of degree 2 in G. It is immediate that G is
2-connected. Furthermore, G contains a path P of length 3 from u to v, and G E(P) has
no path from u to v.