A characterization of graphs with disjoint dominating and total dominating sets

Michael A. Henning; Justin Southey

doi:10.2989/QM.2009.32.1.10.712

A characterization of graphs with disjoint dominating and total dominating sets

Michael A. Henning, Justin Southey

University of KwaZulu-Natal

Research output: Contribution to journal › Article › peer-review

18 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 language	English
Pages (from-to)	119-129
Number of pages	11
Journal	Quaestiones Mathematicae
Volume	32
Issue number	1
DOIs	https://doi.org/10.2989/QM.2009.32.1.10.712
Publication status	Published - Mar 2009
Externally published	Yes

Keywords

Domination
Total domination
Vertex partition

ASJC Scopus subject areas

Mathematics (miscellaneous)

Access to Document

10.2989/QM.2009.32.1.10.712

Cite this

@article{392ca0e3b47747a8b14f4fe97c1e8f22,

title = "A characterization of graphs with disjoint dominating and total dominating sets",

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.",

keywords = "Domination, Total domination, Vertex partition",

author = "Henning, {Michael A.} and Justin Southey",

year = "2009",

month = mar,

doi = "10.2989/QM.2009.32.1.10.712",

language = "English",

volume = "32",

pages = "119--129",

journal = "Quaestiones Mathematicae",

issn = "1607-3606",

publisher = "Taylor and Francis Ltd.",

number = "1",

}

TY - JOUR

T1 - A characterization of graphs with disjoint dominating and total dominating sets

AU - Henning, Michael A.

AU - Southey, Justin

PY - 2009/3

Y1 - 2009/3

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

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

KW - Domination

KW - Total domination

KW - Vertex partition

UR - http://www.scopus.com/inward/record.url?scp=68249134142&partnerID=8YFLogxK

U2 - 10.2989/QM.2009.32.1.10.712

DO - 10.2989/QM.2009.32.1.10.712

M3 - Article

AN - SCOPUS:68249134142

SN - 1607-3606

VL - 32

SP - 119

EP - 129

JO - Quaestiones Mathematicae

JF - Quaestiones Mathematicae

IS - 1

ER -

A characterization of graphs with disjoint dominating and total dominating sets

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this