Tutorial Activity 8

Info icon This preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
MH 8300 Tutorial Activity 8 Minimum Spanning Tree Group Members Name NTU Email ID Marks : /2
Image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
MH 8300 Tutorial Activity 8 Minimum Spanning Tree Consider the following undirected edge-weighted graph G on the vertex set V = {A, B, C, D, E, F, G, H, I, J}. Question 1. Answer the following questions. (a) Apply Kruskal’s algorithm to find T , the minimum spanning tree of G . (Trace the dotted lines to show the MST.) (b) Determine the weight of the minimum spanning tree T .
Image of page 2
Definition. (Induced Subgraph) Let G be a graph with vertex set V . Suppose V 0 is a subset of V . A graph G [ V 0 ] is an induced subgraph of G by V 0 which is obtained by deleting all vertices in V \ V 0 and all edges incident to them from graph G . Question 2. Consider the vertex set V 1 = {D, E, F, G, H, I, J} which is a subset of V . (a) Draw G 1 , the induced subgraph of G by V 1 . (b) Apply Kruskal’s algorithm to find T 1 , the minimum spanning tree of G 1 . (c) Determine the weight of the minimum spanning tree T 1 . (d) Draw the induced subgraph of T by V 1 . (Note : T is the MST found in Qn 1(a))
Image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern