A survey of selected recent results on total domination in graphs

Michael A. Henning

doi:10.1016/j.disc.2007.12.044

A survey of selected recent results on total domination in graphs

Michael A. Henning

University of KwaZulu-Natal

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

274 Citations (Scopus)

Abstract

A set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to some vertex in S. In this paper, we offer a survey of selected recent results on total domination in graphs.

Original language	English
Pages (from-to)	32-63
Number of pages	32
Journal	Discrete Mathematics
Volume	309
Issue number	1
DOIs	https://doi.org/10.1016/j.disc.2007.12.044
Publication status	Published - 6 Jan 2009
Externally published	Yes

Keywords

Total domination
Total domination number

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/j.disc.2007.12.044

Cite this

@article{2aa30f610a584414afaa293991349540,

title = "A survey of selected recent results on total domination in graphs",

abstract = "A set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to some vertex in S. In this paper, we offer a survey of selected recent results on total domination in graphs.",

keywords = "Total domination, Total domination number",

author = "Henning, {Michael A.}",

year = "2009",

month = jan,

day = "6",

doi = "10.1016/j.disc.2007.12.044",

language = "English",

volume = "309",

pages = "32--63",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - A survey of selected recent results on total domination in graphs

AU - Henning, Michael A.

PY - 2009/1/6

Y1 - 2009/1/6

N2 - A set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to some vertex in S. In this paper, we offer a survey of selected recent results on total domination in graphs.

AB - A set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to some vertex in S. In this paper, we offer a survey of selected recent results on total domination in graphs.

KW - Total domination

KW - Total domination number

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

U2 - 10.1016/j.disc.2007.12.044

DO - 10.1016/j.disc.2007.12.044

M3 - Article

AN - SCOPUS:56349107428

SN - 0012-365X

VL - 309

SP - 32

EP - 63

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1

ER -

A survey of selected recent results on total domination in graphs

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this