Minimal Graphs with Disjoint Dominating and Total Dominating Sets

Michael A. Henning, Jerzy Topp

Research output: Contribution to journalArticlepeer-review

Abstract

A graph G is a DTDP-graph if it has a pair (D, T) of disjoint sets of vertices of G such that D is a dominating set and T is a total dominating set of G. Such graphs were studied in a number of research papers. In this paper we study further properties of DTDP-graphs and, in particular, we characterize minimal DTDP-graphs without loops.

Original languageEnglish
JournalDiscussiones Mathematicae - Graph Theory
DOIs
Publication statusAccepted/In press - 2021

Keywords

  • domination
  • total domination

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Minimal Graphs with Disjoint Dominating and Total Dominating Sets'. Together they form a unique fingerprint.

Cite this