﻿Find the exact minimum vertex cover of the following graph with 50 nodes:

Nodes: 0 through 49
Edges: Every node i is connected to node (i+1) mod 50, node (i+7) mod 50, and node (i+13) mod 50.

This is a regular graph with 150 edges. Minimum vertex cover is NP-hard. You must find the provably optimal solution, not an approximation.
