A characterization of trees having a minimum vertex cover which is also a minimum total dominating set

zbMath1411.05206arXiv1705.00216MaRDI QIDQ5377033

César Hernández-Cruz, Magdalena Lemańska, Rita E. Zuazua

Publication date: 23 May 2019

Full work available at URL: https://arxiv.org/abs/1705.00216

zbMATH Keywords

vertex cover numberminimum vertex cover problem

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Construction for trees without domination critical vertices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A characterization of trees with equal independent domination and secure domination numbers
• Fixed-parameter tractability and completeness II: On completeness for W[1]
• A survey of selected recent results on total domination in graphs
• A constructive characterization of trees with at least k disjoint maximum matchings
• Construction of trees and graphs with equal domination parameters
• Edge dominating sets and vertex covers
• Total domination in graphs
• A characterization of Roman trees
• Characterizations of trees with equal domination parameters
• A characterization of trees with equal 2-domination and 2-independence numbers
• Total Domination in Graphs

This page was built for publication: A characterization of trees having a minimum vertex cover which is also a minimum total dominating set