#3. In the following graph find (if several of same size exists- write just one instance of) Maximum Independent Set – Minimum Vertex Cover Maximum Clique Show transcribed image text #3. In the following graph find (if several of same size exists- write just one instance of) Maximum Independent Set – Minimum Vertex Cover Maximum Clique
Answer
Independentset :
A set of vertices V is called independent set if no two verticesin set V are adjacent to
OR
OR