Bounds on the paired domination number of graphs with minimum degree at least three

Michael A. Henning; Monika Pilśniak; Elżbieta Tumidajewicz

doi:10.1016/j.amc.2021.126782

Bounds on the paired domination number of graphs with minimum degree at least three

Michael A. Henning, Monika Pilśniak, Elżbieta Tumidajewicz

Mathematics and Applied Mathematics

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

4 Citations (Scopus)

Abstract

A set S of vertices in a graph G is a paired dominating set if every vertex of G is adjacent to a vertex in S and the subgraph induced by S contains a perfect matching (not necessarily as an induced subgraph). The minimum cardinality of a paired dominating set of G is the paired domination number γ_pr(G) of G. In this paper, we show that if G is a graph of order n and δ(G)≥3, then [Formula presented].

Original language	English
Article number	126782
Journal	Applied Mathematics and Computation
Volume	417
DOIs	https://doi.org/10.1016/j.amc.2021.126782
Publication status	Published - 15 Mar 2022

Keywords

Bounds
Paired domination

ASJC Scopus subject areas

Computational Mathematics
Applied Mathematics

Access to Document

10.1016/j.amc.2021.126782

Cite this

@article{cb7617aeedb14567a3e565674b7f2640,

title = "Bounds on the paired domination number of graphs with minimum degree at least three",

abstract = "A set S of vertices in a graph G is a paired dominating set if every vertex of G is adjacent to a vertex in S and the subgraph induced by S contains a perfect matching (not necessarily as an induced subgraph). The minimum cardinality of a paired dominating set of G is the paired domination number γpr(G) of G. In this paper, we show that if G is a graph of order n and δ(G)≥3, then [Formula presented].",

keywords = "Bounds, Paired domination",

author = "Henning, {Michael A.} and Monika Pil{\'s}niak and El{\.z}bieta Tumidajewicz",

note = "Publisher Copyright: {\textcopyright} 2021",

year = "2022",

month = mar,

day = "15",

doi = "10.1016/j.amc.2021.126782",

language = "English",

volume = "417",

journal = "Applied Mathematics and Computation",

issn = "0096-3003",

publisher = "Elsevier Inc.",

}

TY - JOUR

T1 - Bounds on the paired domination number of graphs with minimum degree at least three

AU - Henning, Michael A.

AU - Pilśniak, Monika

AU - Tumidajewicz, Elżbieta

PY - 2022/3/15

Y1 - 2022/3/15

N2 - A set S of vertices in a graph G is a paired dominating set if every vertex of G is adjacent to a vertex in S and the subgraph induced by S contains a perfect matching (not necessarily as an induced subgraph). The minimum cardinality of a paired dominating set of G is the paired domination number γpr(G) of G. In this paper, we show that if G is a graph of order n and δ(G)≥3, then [Formula presented].

AB - A set S of vertices in a graph G is a paired dominating set if every vertex of G is adjacent to a vertex in S and the subgraph induced by S contains a perfect matching (not necessarily as an induced subgraph). The minimum cardinality of a paired dominating set of G is the paired domination number γpr(G) of G. In this paper, we show that if G is a graph of order n and δ(G)≥3, then [Formula presented].

KW - Bounds

KW - Paired domination

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

U2 - 10.1016/j.amc.2021.126782

DO - 10.1016/j.amc.2021.126782

M3 - Article

AN - SCOPUS:85119192016

SN - 0096-3003

VL - 417

JO - Applied Mathematics and Computation

JF - Applied Mathematics and Computation

M1 - 126782

ER -

Bounds on the paired domination number of graphs with minimum degree at least three

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this