40 likes | 235 Views
Topic: Connectivity and Paths: Cuts and Connectivity By. Presentation on FDP 101X_LAB ACTIVITY ON 07/10/18. THOTA SANDEEP KUMAR REDDY Assistant Professor, Department of CSE, IIIT – R.K.Valley , RGUKT, Kadapa-516330, Andhra Pradesh. Reflection Spot Activity.
E N D
Topic:Connectivity and Paths: Cuts and Connectivity By Presentation on FDP 101X_LAB ACTIVITY ON 07/10/18 THOTA SANDEEP KUMAR REDDY Assistant Professor, Department of CSE, IIIT – R.K.Valley , RGUKT, Kadapa-516330, Andhra Pradesh.
Reflection Spot Activity • Reflection spot time at video is 5:01 min • The Question is about ” how many vertices and edges are can be deleted, then why keeping it is connected” ? Think for few minutes and watch the below nptel video link for further explanation. https://www.youtube.com/watch?v=pRd96941zwE&feature=youtu.be
PRACTICE PROBLEMS/LBD’S • Consider below connected graphs,
PRACTICE PROBLEMS/LBD’S …. 1. Which of the following graphs have vertex connectivity is 2 ? a) G1 , G2 b) G2 , G3 c) G3 , G5 d) G3 , G4 e) G4 , G5 2. Which of the following graph doesn’t have cut-vertex? a) G1 b) G2 c) G3 d) None of the above 3. Vertex cut for graph G5 are……….. a) { b , c , f} b) { b, c } c) { c , f } d) { b , f } Please refer below link for Answers & Explanations of above questions, https://sandeepcseiiit.wordpress.com/fdp-101x_lab-activity-on-06-10-18/