On total vertex covers and edge domination in graphs

Authors

  • Klostermeyer, William P.
  • Yeo, Anders

Abstract

We resolve a conjecture of Dutton and Klostermeyer [Discus-siones Mathematicae Graph Theory (2013)] relating total vertex covers and edge dominating sets in graphs. A number of other results are given concerning the relationship between total vertex covers and edge dominating sets in caterpillars, trees, and other classes of graphs. Some NP-hardness results are also given. For example, it is shown to be NP-hard to determine if the total domination number of a graph equals the total vertex cover number. © 2017 Utilitas Mathematica Publishing Inc.. All rights reserved.

Published

2017-11-09

How to Cite

Klostermeyer, William P., & Yeo, Anders. (2017). On total vertex covers and edge domination in graphs. Utilitas Mathematica, 105. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/1157

Issue

Vol. 105 (2017): Volume 105, 2017

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.