An upper bound on the paired-domination number in terms of the number of edges in the graph
type: Item
instance of: scholarly article
title: An upper bound on the paired-domination number in terms of the number of edges in the graph
zbMATH Open document ID: 1248.05139
author: Michael A. Henning
published in: Discrete Mathematics
publication date: 2010-10-19T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 5802635
zbMATH Keywords: bounds
zbMATH Keywords: paired domination set
zbMATH Keywords: paired domination number
zbMATH Keywords: minimum degree 2
zbMATH Keywords: size
zbMATH Keywords: perfect matching
MaRDI profile type: Publication
full work available at URL: j.disc.2010.06.033
OpenAlex ID: W2060681653
cites work: Q5442178
cites work: Q5463506
cites work: Total and paired-domination numbers of a tree
cites work: Q5461697
cites work: Upper bounds on the paired-domination number
cites work: Q5433058
cites work: Paired domination on interval and circular-arc graphs
cites work: A polynomial-time algorithm for the paired-domination problem on permutation graphs
cites work: Paired-domination in \(P_{5}\)-free graphs
cites work: Paired-domination in generalized claw-free graphs
cites work: Paired-domination in claw-free cubic graphs
cites work: Paired-domination number of a graph and its complement
cites work: Paired-domination
cites work: A characterization of cubic graphs with paired-domination number three-fifths their order
cites work: Q4368728
cites work: Q4368729
cites work: Paired-domination in graphs
cites work: Q3838207
cites work: Q3421937
cites work: Q5488345
cites work: Graphs with large paired-domination number
cites work: Vertices contained in all or in no minimum paired-dominating set of a tree
cites work: The diameter of paired-domination vertex critical graphs
cites work: Q5503338
cites work: Paired-domination of trees
DOI: 10.1016/J.DISC.2010.06.033
description: scientific article; zbMATH DE number 5802635