Total vertex covers (Q2839639)

For a graph \(G\), a subset of vertices \(S\) is said to be a total vertex cover when every vertex has a neighbor in \(S\) and every edge has at least one endpoint in \(S\). The number of vertices in a smallest total vertex cover is called the total vertex cover number of \(G\). In this paper upper and lower bounds concerning this parameter in connected graphs are developed. Extremal graphs related to some such bounds are also described.