Bounds on the paired domination number of graphs with minimum degree at least three
type: Item
instance of: scholarly article
title: Bounds on the paired domination number of graphs with minimum degree at least three
author: Michael A. Henning
author: Monika Pilśniak
author: Elżbieta Tumidajewicz
published in: Applied Mathematics and Computation
publication date: 2021-12-13T00:00:00Z
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 7442855
zbMATH Keywords: paired domination
zbMATH Keywords: bounds
MaRDI profile type: Publication
full work available at URL: j.amc.2021.126782
OpenAlex ID: W3212838666
cites work: Domination number of graphs with minimum degree five
cites work: Q5433058
cites work: Paired Domination in Graphs
cites work: A characterization of cubic graphs with paired-domination number three-fifths their order
cites work: Models of Domination in Graphs
cites work: Q3838207
cites work: Paired-domination in graphs
cites work: Graphs with large paired-domination number
cites work: Total Domination in Graphs
cites work: A note on the upper bound for the paired-domination number of a graph with minimum degree at least two
cites work: Paired-domination in claw-free graphs with minimum degree at least three
DOI: 10.1016/J.AMC.2021.126782
description: scientific article; zbMATH DE number 7442855