A graph, G, has a minimum vertex cover of size |V| - 1 if and only if G is complete. Is it true?
Question
A mesh can be an example of a complete G. Where each node is connected to every other node. So shouldn't the minimum vertex cover size for such a graph is '1'.
1 answers
solution1
0 2017-09-12 14:30:45
Minimum vertex cover is the set of vertices such that every edge is touching a vertex in the set. Given a mesh (complete graph) of A B and C , if you only have one node (say A ) as your attempted MVC, you're missing an edge (in this case the edge BC ).
The technical post webpages of this site follow the CC BY-SA 4.0 protocol. If you need to reprint, please indicate the site URL or the original address.Any question please contact:yoyou2525@163.com.
Related Question
Minimum Vertex Cover On A Bipartite Graph
Algorithm for minimum vertex cover in Bipartite graph
How to find weighted minimum vertex cover of graph
Given an undirected graph G = (V, E), determine whether G is a complete graph
Minimum Vertex Cover of Tree
Minimum vertex cover
Find the N highest cost vertices that has a path to S, where S is a vertex in an undirected Graph G
Find minimum vertex Cover for bipartite graph given the maximum matching
Let G=(V, E) directed graph. Let v be a vertex in G, find the number of vertices that take part in non-simple directed paths to v
What should be the size of the minimum vertex cover set for the below test case?
Related Tags