FindVertexCover

 FindVertexCover(graph)

algorithm to find a vertex cover for a graph. A vertex cover is a set of vertices that touches all the edges in the graph.

See

• Wikipedia - Vertex cover

Examples

>> FindVertexCover({1<->2,1<->3,2<->3,3<->4,3<->5,3<->6})
{3,1}

Related terms

GraphCenter, GraphDiameter, GraphPeriphery, GraphRadius, AdjacencyMatrix, EdgeList, EdgeQ, EulerianGraphQ, FindEulerianCycle, FindHamiltonianCycle, FindShortestPath,FindSpanningTree, FindShortestTour, Graph, GraphQ, HamiltonianGraphQ, VertexEccentricity, VertexList, VertexQ

Implementation status

• ✅ - full supported

Github

• Implementation of FindVertexCover