58 votes 58 votes What is the size of the smallest $\textsf{MIS}$ (Maximal Independent Set) of a chain of nine nodes? $5$ $4$ $3$ $2$ Graph Theory gateit-2008 normal graph-connectivity + – Ishrat Jahan asked Oct 27, 2014 • edited Dec 29, 2017 by kenzou Ishrat Jahan 59.2k views answer comment Share Follow See all 9 Comments See all 9 9 Comments reply Show 6 previous comments Nandkishor3939 commented Sep 28, 2019 reply Follow Share no 0 votes 0 votes val_pro20 commented Jan 16, 2021 reply Follow Share you cant take 4,8 as maximal becoz adding 1 or 6 will still provide a maximal independent set 0 votes 0 votes neel19 commented Feb 2, 2021 reply Follow Share These questions should be in graph theory and not in DS. 2 votes 2 votes Please log in or register to add a comment.
Best answer 52 votes 52 votes Answer: C $1-2-3-4-5-6-7-8-9$ $(2,5,8)$ is the maximal independent set for a chain of $9$ nodes. If we add any other node to the set then it will not be MIS. Rajarshi Sarkar answered Apr 16, 2015 • edited Dec 29, 2017 by kenzou Rajarshi Sarkar comment Share Follow See all 16 Comments See all 16 16 Comments reply Purple commented Jan 23, 2016 reply Follow Share Why not (1,3,5,7,9) or (2,4,6,8)?? How did u get (2,5,8)? 10 votes 10 votes shikharV commented Jan 28, 2016 reply Follow Share Are you sure this answer is correct? What about Mithlesh's answer? 0 votes 0 votes pC commented May 7, 2016 reply Follow Share How is this possible ? MIS is maximization probelm which goes like this ... For a graph G = (V,E), a set of nodes S ⊆ V is called independent if no two nodes in S are connected by an edge e ∈ E. The Independent Set problem is to find the largest independent set in a graph. It is not hard to find small independent sets, e.g. a trivial independent set is any single node. Since they asked smallest one it is one vertex ( say any vertex ) given option has 2 as smallest number so 2 would have been approriate answer . However MIS is maximization probelm . MIS of given chain would have been { 1-3-5-7-9 } @Arjun Sir pls varify this answer . 3 votes 3 votes Rajesh Raj commented Dec 18, 2016 reply Follow Share what is MIS ? how is it calculated @pc 0 votes 0 votes Sachin Mittal 1 commented Dec 22, 2016 reply Follow Share @pc u r wrong. The definition u provided is the definition for Independent set, NOT for MIS. Finding independent set is never an interesting question, But MIS is. There can be more than MIS for given graph, and they are asking for smallest MIS. See this, here cenral vertex forms one MIS and all others forms another. smallest set is a set with cener vertex only. 26 votes 26 votes priyanka gautam-piya commented Dec 29, 2016 reply Follow Share can uh plz explain MIS .. i am not getting the concept ?? 1 votes 1 votes nimesh kumar commented Jan 18, 2017 reply Follow Share independence set : set of non adjacent vertices maximum independent set : the maximum no of non adjacent vertices. u will get the concept now. u have to find smallest among the maximum 16 votes 16 votes Puja Mishra commented Jan 27, 2017 reply Follow Share Minimum no of color to cover the verticies is 3.. then the size is 3.. can i say like this ?? 0 votes 0 votes akb1115 commented Sep 11, 2017 reply Follow Share @priyanka gautam-piya @ pC Maximal Independent Set (MIS) means the set of independent edges to which if we try to add any other edge then it will no longer remain the independent Set. Don't confuse it with the maximum independent set. 3 votes 3 votes rahul sharma 5 commented Oct 4, 2017 reply Follow Share might be useful https://www.youtube.com/watch?v=03PUwWef2Dg 10 votes 10 votes smsubham commented Dec 23, 2017 reply Follow Share In graph theory, a maximal independent set (MIS) or maximal stable set is an independent set that is not a subset of any other independent set. In other words, there is no vertex outside the independent set that may join it because it is maximal with respect to the independent set property. Ref: https://en.wikipedia.org/wiki/Maximal_independent_set 3 votes 3 votes Sunny Mukherjee commented Jan 6, 2018 reply Follow Share Thanks man ... perfect :-) 0 votes 0 votes sushmita commented Jan 18, 2019 reply Follow Share maximum--> maximal maximal does not always imply maximum. 8 votes 8 votes shashankrustagi commented Oct 31, 2020 reply Follow Share She is the best in Graph theory 0 votes 0 votes Vinay singh commented Dec 19, 2020 reply Follow Share They have asked for chain …, otherwise we can also go with 2 nodes only …? please exaplined .. 0 votes 0 votes shashankrustagi commented Dec 20, 2020 reply Follow Share Think the best, forget the rest 0 votes 0 votes Please log in or register to add a comment.
80 votes 80 votes 1--2--3--4--5--6--7--8--9 MIS of size 5 : 1,3,5,7,9 MIS os size 4 : 2,4,6,8 MIS of size 3 : 2,5,8 MIS is independent set in which If we add any other node (outside MIS) to the set then it will be no more MIS. so smallest size of MIS is 3 Option C skrahul answered Dec 30, 2015 skrahul comment Share Follow See all 14 Comments See all 14 14 Comments reply Show 11 previous comments MANSI_SOMANI commented Jan 27, 2023 reply Follow Share @AKASH G more can exist but here example which u have given, can't take that, as we can include here 9 too, so size will become 4 not 3 0 votes 0 votes P C commented Jan 27, 2023 reply Follow Share If you have somemore question related to this or resources please add . @MANSI_SOMANI got it 👍 thanks! 1 votes 1 votes Chaitanya Sai commented Sep 12, 2023 reply Follow Share How set {1,9} will not be a MIS for the above sequence? 0 votes 0 votes Please log in or register to add a comment.
10 votes 10 votes If we try to add any vertext in set {2,5,8} then that vertex will be adjacent to 2 or 5 or 8 like if we want to add 4 that will be adjacent to 5 so independent set property will be lost.We cant take 2 vertices as Maximal property will not hold, we have to make it mamximum in such a way that the no of vertices will be minimum to make it MIS.1,4,7 is also a MIS so C) is the ans Pranabesh Ghosh 1 answered Nov 10, 2016 • edited Apr 19, 2017 by Pranabesh Ghosh 1 Pranabesh Ghosh 1 comment Share Follow See all 3 Comments See all 3 3 Comments reply Pawan Kumar 2 commented Sep 19, 2017 reply Follow Share why cant we take only 2 vertices only... i mean just 2 and 7 or 2 and 9 ...? 0 votes 0 votes smsubham commented Dec 23, 2017 reply Follow Share @pawan Because then we can include other vertices, so it's not MIS. 1 votes 1 votes navalkishoreb commented Nov 21, 2019 reply Follow Share wrong in {1,4,7} we can add 9 to make it mis. 1 votes 1 votes Please log in or register to add a comment.
7 votes 7 votes A set of vertices is called independent set such that no two vertices in the set are adjacent. A maximal independent set (MIS) is an independent set which is not subset of any other independent set. The question is about smallest MIS. We can see in below diagram, the three highlighted vertices (2nd, 5th and 8th) form a maximal independent set (not subset of any other MIS) and smallest MIS. 0----0----0----0----0----0----0----0----0 Madhab answered Jan 20, 2017 Madhab comment Share Follow See all 4 Comments See all 4 4 Comments reply Pawan Kumar 2 commented Sep 19, 2017 reply Follow Share why cant we take only 2 vertices only... i mean just 2 and 7 or 2 and 9 ...? 1 votes 1 votes Kaluti commented Oct 15, 2017 reply Follow Share here maximal independent set referes to smallest independent set if you add any other vertex to it it would no longer be independent set 2 votes 2 votes Madhab commented Nov 4, 2017 reply Follow Share here we cant add (2,7) or (2,9) because in case of (2,7) we can add 9 which is not adjacent so it will not become MIS anymore and in case of (2,9( also we can add 5 or 7 so it will not be MIS. 1 votes 1 votes prithvish111 commented Mar 5, 2021 reply Follow Share I got the answer after thinking about this point, MIS means if you add any(single) node, it should be no longer independent set(IS) (should break IS rule), but in case of 2 vertices, by adding a node IS rule is not breaking. 0 votes 0 votes Please log in or register to add a comment.