Domination parameters of a graph and its complement

Wyatt J. Desormeaux; Teresa W. Haynes; Michael A. Henning

doi:10.7151/dmgt.2002

Domination parameters of a graph and its complement

Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning

Mathematics and Applied Mathematics

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

5 Citations (Scopus)

Abstract

A dominating set in a graph G is a set S of vertices such that every vertex in V (G) \ S is adjacent to at least one vertex in S, and the domination number of G is the minimum cardinality of a dominating set of G. Placing constraints on a dominating set yields different domination parameters, including total, connected, restrained, and clique domination numbers. In this paper, we study relationships among domination parameters of a graph and its complement.

Original language	English
Pages (from-to)	203-215
Number of pages	13
Journal	Discussiones Mathematicae - Graph Theory
Volume	38
Issue number	1
DOIs	https://doi.org/10.7151/dmgt.2002
Publication status	Published - 2018

Keywords

Clique domination
Complement
Connected domination
Domination
Restrained domination
Total domination

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.7151/dmgt.2002

Cite this

@article{55e63fed8a54433d92025438a1829dae,

title = "Domination parameters of a graph and its complement",

abstract = "A dominating set in a graph G is a set S of vertices such that every vertex in V (G) \ S is adjacent to at least one vertex in S, and the domination number of G is the minimum cardinality of a dominating set of G. Placing constraints on a dominating set yields different domination parameters, including total, connected, restrained, and clique domination numbers. In this paper, we study relationships among domination parameters of a graph and its complement.",

keywords = "Clique domination, Complement, Connected domination, Domination, Restrained domination, Total domination",

author = "Desormeaux, {Wyatt J.} and Haynes, {Teresa W.} and Henning, {Michael A.}",

year = "2018",

doi = "10.7151/dmgt.2002",

language = "English",

volume = "38",

pages = "203--215",

journal = "Discussiones Mathematicae - Graph Theory",

issn = "1234-3099",

publisher = "University of Zielona Gora",

number = "1",

}

TY - JOUR

T1 - Domination parameters of a graph and its complement

AU - Desormeaux, Wyatt J.

AU - Haynes, Teresa W.

AU - Henning, Michael A.

PY - 2018

Y1 - 2018

N2 - A dominating set in a graph G is a set S of vertices such that every vertex in V (G) \ S is adjacent to at least one vertex in S, and the domination number of G is the minimum cardinality of a dominating set of G. Placing constraints on a dominating set yields different domination parameters, including total, connected, restrained, and clique domination numbers. In this paper, we study relationships among domination parameters of a graph and its complement.

AB - A dominating set in a graph G is a set S of vertices such that every vertex in V (G) \ S is adjacent to at least one vertex in S, and the domination number of G is the minimum cardinality of a dominating set of G. Placing constraints on a dominating set yields different domination parameters, including total, connected, restrained, and clique domination numbers. In this paper, we study relationships among domination parameters of a graph and its complement.

KW - Clique domination

KW - Complement

KW - Connected domination

KW - Domination

KW - Restrained domination

KW - Total domination

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

U2 - 10.7151/dmgt.2002

DO - 10.7151/dmgt.2002

M3 - Article

AN - SCOPUS:85037656916

SN - 1234-3099

VL - 38

SP - 203

EP - 215

JO - Discussiones Mathematicae - Graph Theory

JF - Discussiones Mathematicae - Graph Theory

IS - 1

ER -

Domination parameters of a graph and its complement

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this