0 votes 0 votes Graph Theory vertex-cover + – Deepalitrapti asked Oct 16, 2018 • recategorized Oct 17, 2018 by Shaik Masthan Deepalitrapti 681 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments minal commented Oct 17, 2018 reply Follow Share then whats ans ? vertex cover+independent set = n n =8 , single vertex cover all vertex .. so vertex cover is 1, independent set =7 so its 7 , but if i mannully calculate independent set it cant be 7 . 0 votes 0 votes Magma commented Oct 17, 2018 reply Follow Share I got 15 :3 hope it's right 0 votes 0 votes Magma commented Oct 17, 2018 reply Follow Share Deepalitrapti what's the answer given ?? 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes there are 4 independent sets U : {1} V: {8,4,2} W: {7,5,3} X: {6} X = Cardinality of largest independent sets : | V | = 3 Y = vertex cover : 5 X * Y = 15 Ans Magma answered Oct 17, 2018 Magma comment Share Follow See all 4 Comments See all 4 4 Comments reply minal commented Oct 17, 2018 reply Follow Share vertex cover should be minimum na i did same but ... 1 can cover all vertex , how it will be more ? or i have some misconcept about vertex cover 0 votes 0 votes Magma commented Oct 17, 2018 reply Follow Share minal In Vertex cover you have to cover all the edges 0 votes 0 votes Magma commented Oct 17, 2018 reply Follow Share and In matching you have to cover all the vertices by minimum number of edges 0 votes 0 votes minal commented Oct 19, 2018 reply Follow Share thanks ..somehow i mislead 0 votes 0 votes Please log in or register to add a comment.