An infinite family of graphs for which a heuristic solution to the vertex cover works


Suppose we do a DFS on an undirected, connected graph G. Then we find a series of non-leaf vertices that form a vertex coverage of G.
What could be an infinite family of graphs for which this heuristic finds a vertex coverage twice the size of a minimum vertex point coverage?