Minimum Vertex Cover on a Single Vertex Is the minimum vertex cover on a graph with just one vertex, with no edges, 0 or 1?
I think it is 0 because there are no edges and hence no vertices need to be in the minimum vertex cover to satisfy the property that every edge must have at least one endpoint in the vertex cover set.
I am just not sure if there is a rule that says |minimum vertex cover| is strictly positive.
Thanks :)

The definition applies.  If there are no edges (regardless of one or more vertices), no vertices are needed in the "vertex cover" to satisfy the covering condition (which is vacuously true).
