Trees with large total domination number

Authors

  • Henning, Michael A.

Abstract

It is well-known that the total domination number γt(G) of a graph G without isolated vertices is at most twice its domination number γ(G). We provide a constructive characterization of trees T satisfying γt(T) = 2γ(T).

Published

2001-06-09

How to Cite

Henning, Michael A. (2001). Trees with large total domination number. Utilitas Mathematica, 60. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/210

Issue

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.