Discuss about a connected graph


Discuss the below:

Q: Let G be a simple graph on n (greater or equal then) 3 vertices such that deg_G(v) (greater or equal to) n/2 for every vertex v E V(G). Prove that deleting any vertex of G results in a connected graph (i.e. G is 2-connected).

Solution Preview :

Prepared by a verified Expert
Data Structure & Algorithms: Discuss about a connected graph
Reference No:- TGS01929436

Now Priced at $20 (50% Discount)

Recommended (94%)

Rated (4.6/5)