Correct answer: (C) Graph has a vertex cover of size at most3n/4.
Explanation
We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort
More Discrete Mathematics: Graphs (Connectivity, Matching, Colouring) questions
GATE 2008 CS Q42– Graph G has n vertices and2n−2 edges partitionable into two edge-disjoint spanning trees.…
GATE 2007 CS Q4– Let G be a nonplanar graph with the minimum possible number of edges. G has