Trees with large total domination number

Research output: Contribution to journalArticlepeer-review

19 Citations (Scopus)

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).

Original languageEnglish
Pages (from-to)99-106
Number of pages8
JournalUtilitas Mathematica
Volume60
Publication statusPublished - Nov 2001
Externally publishedYes

ASJC Scopus subject areas

  • Statistics and Probability
  • Statistics, Probability and Uncertainty
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Trees with large total domination number'. Together they form a unique fingerprint.

Cite this