Course Solutions Uncategorized (Solved) : 5 Connectivity Number Graph G Smallest Number Vertices Whose Removal G Makes Disconnected Q29695241 . . . .

(Solved) : 5 Connectivity Number Graph G Smallest Number Vertices Whose Removal G Makes Disconnected Q29695241 . . . .

 

5. (a) The connectivity number of a graph G is the smallest number of vertices whose removal from G makes it disconnected. Determine the connectivity numbers of (6 marks) the two graphs G1 and G2 shown below. U1 V1 V2 V6 U6 V3 US VS G1 G2 U4 V4 b) What is the connectivity number of a tree with at least three vertices? (3 marks) c) What is the connectivity number of a graph with at least two vertices that has 3 marks) no edges?

5. (a) The connectivity number of a graph G is the smallest

OR

PayPal Gateway not configured

OR

PayPal Gateway not configured

Leave a Reply

Your email address will not be published. Required fields are marked *

Related Post