A characterization of graphs with disjoint dominating and total dominating sets

Michael A. Henning, Justin Southey

Research output: Contribution to journalArticlepeer-review

16 Citations (Scopus)

Abstract

A dominating set of a graph is a set of vertices such that every vertex not in the set is adjacent to a vertex in the set, while a total dominating set of a graph is a set of vertices such that every vertex is adjacent to a vertex in the set. In this paper, we provide a constructive characterization of graphs whose vertex set can be partitioned into a dominating set and a total dominating set.

Original languageEnglish
Pages (from-to)119-129
Number of pages11
JournalQuaestiones Mathematicae
Volume32
Issue number1
DOIs
Publication statusPublished - Mar 2009
Externally publishedYes

Keywords

  • Domination
  • Total domination
  • Vertex partition

ASJC Scopus subject areas

  • Mathematics (miscellaneous)

Fingerprint

Dive into the research topics of 'A characterization of graphs with disjoint dominating and total dominating sets'. Together they form a unique fingerprint.

Cite this