find minimum vertex cover
(optional) equation of the form method = m, where m is exact, greedy, or sat.
MinimumVertexCover returns a list of vertices which comprise a minimum vertex cover.
VertexCoverNumber returns the number of vertices in a minimum vertex cover of the graph G.
A vertex cover of a graph G is a subset S of the vertices of G such that every edge in G is incident to some member of S.
G ≔ GraphComplement⁡CompleteGraph⁡3,4
G≔Graph 1: an undirected graph with 7 vertices and 9 edge(s)
The GraphTheory[MinimumVertexCover] and GraphTheory[VertexCoverNumber] commands were introduced in Maple 2019.
For more information on Maple 2019 changes, see Updates in Maple 2019.
Download Help Document
What kind of issue would you like to report? (Optional)