Disjoint dominating and total dominating sets in graphs

Michael A. Henning; Christian Löwenstein; Dieter Rautenbach; Justin Southey

doi:10.1016/j.dam.2010.06.004

Disjoint dominating and total dominating sets in graphs

Michael A. Henning, Christian Löwenstein, Dieter Rautenbach, Justin Southey

Mathematics and Applied Mathematics

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

10 Citations (Scopus)

Abstract

It has been shown [M.A. Henning, J. Southey, A note on graphs with disjoint dominating and total dominating sets, Ars Combin. 89 (2008) 159-162] that every connected graph with minimum degree at least two that is not a cycle on five vertices has a dominating set D and a total dominating set T which are disjoint. We characterize such graphs for which D∪T necessarily contains all vertices of the graph and that have no induced cycle on five vertices.

Original language	English
Pages (from-to)	1615-1623
Number of pages	9
Journal	Discrete Applied Mathematics
Volume	158
Issue number	15
DOIs	https://doi.org/10.1016/j.dam.2010.06.004
Publication status	Published - 6 Aug 2010

Keywords

Domination
Total domination
Vertex partition

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1016/j.dam.2010.06.004

Cite this

@article{a20683fcbc0c4da4827beafff88c0585,

title = "Disjoint dominating and total dominating sets in graphs",

abstract = "It has been shown [M.A. Henning, J. Southey, A note on graphs with disjoint dominating and total dominating sets, Ars Combin. 89 (2008) 159-162] that every connected graph with minimum degree at least two that is not a cycle on five vertices has a dominating set D and a total dominating set T which are disjoint. We characterize such graphs for which D∪T necessarily contains all vertices of the graph and that have no induced cycle on five vertices.",

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

author = "Henning, {Michael A.} and Christian L{\"o}wenstein and Dieter Rautenbach and Justin Southey",

year = "2010",

month = aug,

day = "6",

doi = "10.1016/j.dam.2010.06.004",

language = "English",

volume = "158",

pages = "1615--1623",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier",

number = "15",

}

TY - JOUR

T1 - Disjoint dominating and total dominating sets in graphs

AU - Henning, Michael A.

AU - Löwenstein, Christian

AU - Rautenbach, Dieter

AU - Southey, Justin

PY - 2010/8/6

Y1 - 2010/8/6

N2 - It has been shown [M.A. Henning, J. Southey, A note on graphs with disjoint dominating and total dominating sets, Ars Combin. 89 (2008) 159-162] that every connected graph with minimum degree at least two that is not a cycle on five vertices has a dominating set D and a total dominating set T which are disjoint. We characterize such graphs for which D∪T necessarily contains all vertices of the graph and that have no induced cycle on five vertices.

AB - It has been shown [M.A. Henning, J. Southey, A note on graphs with disjoint dominating and total dominating sets, Ars Combin. 89 (2008) 159-162] that every connected graph with minimum degree at least two that is not a cycle on five vertices has a dominating set D and a total dominating set T which are disjoint. We characterize such graphs for which D∪T necessarily contains all vertices of the graph and that have no induced cycle on five vertices.

KW - Domination

KW - Total domination

KW - Vertex partition

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

U2 - 10.1016/j.dam.2010.06.004

DO - 10.1016/j.dam.2010.06.004

M3 - Article

AN - SCOPUS:77955414013

SN - 0166-218X

VL - 158

SP - 1615

EP - 1623

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - 15

ER -

Disjoint dominating and total dominating sets in graphs

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this