algorithm - A graph, G, has a minimum vertex cover of size |V| - 1 if and only if G is complete. Is it true? -


a mesh can example of complete g. each node connected every other node. shouldn't minimum vertex cover size such graph '1'.

minimum vertex cover set of vertices such every edge touching vertex in set. given mesh (complete graph) of a b , c, if have 1 node (say a) attempted mvc, you're missing edge (in case edge b-c).


Comments

Popular posts from this blog

php - Embed BBCode within itself not working -

three.js - how to load gltf in three JS -

sql server - T-SQL: Access DB objects in same schema without qualifying? -