Total vertex covers

MaRDI QIDQ2839639zbMATH OpenFDO

Authors Ronald D. Dutton

Publication date 12 July 2013

Published in Bulletin of the Institute of Combinatorics and its Applications (Search for Journal in Brave)

zbMATH Keywords

connected graphdominating setextremal graphtotal dominating settotal vertex coververtex cover

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Review text

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.

Recommendations

• On total covers of graphs
• scientific article; zbMATH DE number 861353
• A characterization of trees having a minimum vertex cover which is also a minimum total dominating set
• scientific article; zbMATH DE number 822142
• On total matching numbers and total covering numbers of complementary graphs

Cited in

(7)

• On total covers of graphs
• Total matchings and total coverings of threshold graphs
• On vertex covering number of rotationally-symmetric graphs
• scientific article; zbMATH DE number 2170477 (Why is no real title available?)
• scientific article; zbMATH DE number 822142 (Why is no real title available?)
• The Vertex Cover Game
• A characterization of trees having a minimum vertex cover which is also a minimum total dominating set

This page was built for publication: Total vertex covers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2839639)