An upper bound on the paired-domination number in terms of the number of edges in the graph

DOI10.1016/j.disc.2010.06.033zbMath1248.05139MaRDI QIDQ710582

Michael A. Henning

Publication date: 19 October 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2010.06.033

zbMATH Keywords

bounds; size; perfect matching; paired domination number; minimum degree 2; paired domination set

Mathematics Subject Classification ID

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

Cites Work

• Paired-domination in claw-free cubic graphs
• Graphs with large paired-domination number
• A characterization of cubic graphs with paired-domination number three-fifths their order
• Vertices contained in all or in no minimum paired-dominating set of a tree
• Paired-domination number of a graph and its complement
• Upper bounds on the paired-domination number
• A polynomial-time algorithm for the paired-domination problem on permutation graphs
• Paired-domination in \(P_{5}\)-free graphs
• Total and paired-domination numbers of a tree
• Paired-domination of trees
• Paired domination on interval and circular-arc graphs
• Paired-domination in generalized claw-free graphs
• The diameter of paired-domination vertex critical graphs
• Paired-domination
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item