Restrained domination excellent trees

Johannes H. Hattingh; Michael A. Henning

Restrained domination excellent trees

Johannes H. Hattingh
, Michael A. Henning

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

7 Citations (Scopus)

Abstract

A set S of vertices in a graph G = (V, E) is a restrained dominating set of G if every vertex not in S is adjacent to a vertex in S and to a vertex in V \ S. The graph G is called restrained domination excellent if every vertex belongs to some minimum restrained dominating set of G. We provide a characterization of restrained domination excellent trees.

Original language	English
Pages (from-to)	337-351
Number of pages	15
Journal	Ars Combinatoria
Volume	87
Publication status	Published - Apr 2008
Externally published	Yes

Keywords

Excellent trees
Restrained domination

ASJC Scopus subject areas

General Mathematics

Cite this

@article{f2b8dde5fd724f9784905c4174c87ef7,

title = "Restrained domination excellent trees",

abstract = "A set S of vertices in a graph G = (V, E) is a restrained dominating set of G if every vertex not in S is adjacent to a vertex in S and to a vertex in V \textbackslash{} S. The graph G is called restrained domination excellent if every vertex belongs to some minimum restrained dominating set of G. We provide a characterization of restrained domination excellent trees.",

keywords = "Excellent trees, Restrained domination",

author = "Hattingh, \{Johannes H.\} and Henning, \{Michael A.\}",

year = "2008",

month = apr,

language = "English",

volume = "87",

pages = "337--351",

journal = "Ars Combinatoria",

issn = "0381-7032",

publisher = "Charles Babbage Research Centre",

}

TY - JOUR

T1 - Restrained domination excellent trees

AU - Hattingh, Johannes H.

AU - Henning, Michael A.

PY - 2008/4

Y1 - 2008/4

N2 - A set S of vertices in a graph G = (V, E) is a restrained dominating set of G if every vertex not in S is adjacent to a vertex in S and to a vertex in V \ S. The graph G is called restrained domination excellent if every vertex belongs to some minimum restrained dominating set of G. We provide a characterization of restrained domination excellent trees.

AB - A set S of vertices in a graph G = (V, E) is a restrained dominating set of G if every vertex not in S is adjacent to a vertex in S and to a vertex in V \ S. The graph G is called restrained domination excellent if every vertex belongs to some minimum restrained dominating set of G. We provide a characterization of restrained domination excellent trees.

KW - Excellent trees

KW - Restrained domination

UR - https://www.scopus.com/pages/publications/44449083420

M3 - Article

AN - SCOPUS:44449083420

SN - 0381-7032

VL - 87

SP - 337

EP - 351

JO - Ars Combinatoria

JF - Ars Combinatoria

ER -

Restrained domination excellent trees

Abstract

Keywords

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this