Trees with equal domination and paired-domination numbers

Teresa W. Haynes; Michael A. Henning; Peter J. Slater

Trees with equal domination and paired-domination numbers

Teresa W. Haynes
, Michael A. Henning
, Peter J. Slater

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

7 Citations (Scopus)

Abstract

A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a perfect matching. The paired-domination number of G is the minimum cardinality of a paired-dominating set of G, and is obviously bounded below by the domination number of G. We give a constructive characterization of the trees with equal domination and paired-domination numbers.

Original language	English
Pages (from-to)	169-175
Number of pages	7
Journal	Ars Combinatoria
Volume	76
Publication status	Published - Jul 2005
Externally published	Yes

ASJC Scopus subject areas

General Mathematics

Cite this

@article{9228fc5735ae48638409138693dda4f2,

title = "Trees with equal domination and paired-domination numbers",

abstract = "A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a perfect matching. The paired-domination number of G is the minimum cardinality of a paired-dominating set of G, and is obviously bounded below by the domination number of G. We give a constructive characterization of the trees with equal domination and paired-domination numbers.",

author = "Haynes, \{Teresa W.\} and Henning, \{Michael A.\} and Slater, \{Peter J.\}",

year = "2005",

month = jul,

language = "English",

volume = "76",

pages = "169--175",

journal = "Ars Combinatoria",

issn = "0381-7032",

publisher = "Charles Babbage Research Centre",

}

TY - JOUR

T1 - Trees with equal domination and paired-domination numbers

AU - Haynes, Teresa W.

AU - Henning, Michael A.

AU - Slater, Peter J.

PY - 2005/7

Y1 - 2005/7

N2 - A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a perfect matching. The paired-domination number of G is the minimum cardinality of a paired-dominating set of G, and is obviously bounded below by the domination number of G. We give a constructive characterization of the trees with equal domination and paired-domination numbers.

AB - A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a perfect matching. The paired-domination number of G is the minimum cardinality of a paired-dominating set of G, and is obviously bounded below by the domination number of G. We give a constructive characterization of the trees with equal domination and paired-domination numbers.

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

M3 - Article

AN - SCOPUS:33644681753

SN - 0381-7032

VL - 76

SP - 169

EP - 175

JO - Ars Combinatoria

JF - Ars Combinatoria

ER -

Trees with equal domination and paired-domination numbers

Abstract

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this