How can the concept of a vertex cover be related to the concept of a set cover?

The concept of a vertex cover in graph theory is related to the concept of a set cover in combinatorial optimization. In a vertex cover, the goal is to find the smallest set of vertices that covers all edges in a graph. In a set cover, the objective is to find the smallest collection of sets that covers all elements in a given universe. Both problems involve finding the minimum number of elements (vertices or sets) needed to cover all the elements (edges or universe) in a system.