GATE CSE
First time here? Checkout the FAQ!
x
+2 votes
107 views
graph of 100 edges and 25 vertices..size of minimum vertex cover is 8..what is the size of  maximum independence set?
asked in Graph Theory by Veteran (20.4k points) 12 77 174 | 107 views

1 Answer

+3 votes
Best answer
If C is a vertex cover of a graph, then Remaining vertices form an Independent Set.

Hence, Total number of Vertices = Minimum Vertex Cover + Size of Maximum Independent Set

=> This gives size of Maximum Independent Set = 25 - 8 = 17
answered by Veteran (50.4k points) 22 90 410
selected by


Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Top Users Oct 2017
  1. Arjun

    23242 Points

  2. Bikram

    17048 Points

  3. Habibkhan

    7096 Points

  4. srestha

    6012 Points

  5. Debashish Deka

    5430 Points

  6. jothee

    4928 Points

  7. Sachin Mittal 1

    4762 Points

  8. joshi_nitish

    4278 Points

  9. sushmita

    3954 Points

  10. Rishi yadav

    3744 Points


Recent Badges

Popular Question Rahul Jain25
Popular Question Ml_Nlp
Notable Question set2018
Notable Question rahul sharma 5
Notable Question Sanjay Sharma
Notable Question Lakshman Patel RJIT
Popular Question makhdoom ghaya
Popular Question Çșȇ ʛấẗẻ
Reader kenzou
Popular Question mystylecse
27,262 questions
35,076 answers
83,760 comments
33,185 users