The edge covering number of a graph is the minimum number of edges that need to be selected such that every vertex of the graph is incident to at least one selected edge.

The edge cover of the graph is the minimum set of edges that covers all the vertices.

The covering number of a set is the minimum number of open sets needed to cover the set.

The vertex cover of a graph is the set of vertices that covers all the edges.

They are covenanting to protect the environment.

They covenanted to support each other in times of need.

The two parties entered into a covenanted agreement.

The covenanters gathered in the church to discuss their plans.

The covered bridge is a popular tourist attraction in the small town.

The company imposed a restrictive covenant on its employees.