edited by
274 views

1 Answer

Best answer
4 votes
4 votes

The vertex cover of a graph is a set of vertices that includes at least one endpoint of every edge of the graph.

A minimum vertex cover is a vertex cover having the smallest possible number of vertices for a given graph. The size of a minimum vertex cover of a graph G is known as the vertex cover number and is denoted $\tau(G).$

Every minimum vertex cover is a minimal vertex cover (i.e., a vertex cover that is not a proper subset of any other cover), but not necessarily vice versa.

Minimum vertex covers correspond to the complements of maximum independent vertex sets.

For the given graph, size of minimum vertex cover $=5,$ shown in cyan color below.


So, the correct answer is $5$.

selected by
Answer:

Related questions

5 votes
5 votes
1 answer
1
gatecse asked Sep 14, 2020
334 views
The number of maximum independent vertex set of the below graph is _________
2 votes
2 votes
1 answer
2
gatecse asked Sep 14, 2020
151 views
In the graphs given below certain vertices are marked in RED. Which of the marked vertices form a vertex cover? (Mark all the appropriate choices)
1 votes
1 votes
1 answer
3
gatecse asked Sep 14, 2020
195 views
If $G$ is a simple graph with $16$ edges and $\overline{G}$ has $12$ edges, how many vertices does the complement graph $\overline{G}$ have?
4 votes
4 votes
1 answer
4
gatecse asked Sep 14, 2020
320 views
The number of possible connected simple graphs with $3$ labelled vertices is ________