Concept drill
independent-set
GATE CSE & IT · Graph Theory · 2005-2024
3
PYQs
100%
keyed
1
elite explanations
3
years appeared
Study anchor
Rosen — Discrete Mathematics and Its Applications
Discrete structures, counting, relations, graph theory
Practice action
Start latest PYQPYQs in this concept
All concepts →2024 PYQ
The chromatic number of a graph is the minimum number of colours used in a proper colouring of the graph. Let $G$ be any graph with $n$ vertices and chromatic number $k$. Which of...
mediumanswer keyelite explanation
2008 PYQ
Which of the following statements is true for every planar graph on $$n$$ vertices?
mediumanswer key
2005 PYQ
Let $$G$$ be the simple graph with 20 vertices and 100 edges. The size of the minimum vertex cover of $$G$$ is 8. Then, the size of the maximum independent set of $$G$$ is:
easyanswer key