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

DOI10.1016/J.DISC.2010.06.033MaRDI QIDQ710582zbMATH OpenOpenAlexFDO

Authors 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

sizeboundsperfect matchingpaired domination numberminimum degree 2paired domination set

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Graphs with large paired-domination number
• Upper bounds on the paired-domination number
• Bounds on the paired domination number of graphs with minimum degree at least three
• The paired-domination and the upper paired-domination numbers of graphs
• Paired domination in graphs

Cites work

• scientific article; zbMATH DE number 1185309 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• scientific article; zbMATH DE number 5221647 (Why is no real title available?)
• scientific article; zbMATH DE number 2188616 (Why is no real title available?)
• scientific article; zbMATH DE number 2192132 (Why is no real title available?)
• scientific article; zbMATH DE number 5054162 (Why is no real title available?)
• A characterization of cubic graphs with paired-domination number three-fifths their order
• A polynomial-time algorithm for the paired-domination problem on permutation graphs
• Graphs with large paired-domination number
• Paired domination on interval and circular-arc graphs
• Paired-domination
• Paired-domination in \(P_{5}\)-free graphs
• Paired-domination in claw-free cubic graphs
• Paired-domination in generalized claw-free graphs
• Paired-domination in graphs
• Paired-domination number of a graph and its complement
• Paired-domination of Cartesian products of graphs
• Paired-domination of trees
• The diameter of paired-domination vertex critical graphs
• Total and paired-domination numbers of a tree
• Trees with large paired-domination number
• Trees with paired-domination number twice their domination number
• Upper bounds on the paired-domination number
• Vertices contained in all or in no minimum paired-dominating set of a tree

Cited in

(13)

• Graphs with maximum size and given paired-domination number
• Upper bounds for the paired-domination numbers of graphs
• Paired-domination number of a graph and its complement
• scientific article; zbMATH DE number 1743834 (Why is no real title available?)
• Paired domination in graphs: a survey and recent results
• Bounds on the paired domination number of graphs with minimum degree at least three
• Upper bounds on the paired domination subdivision number of a graph
• Paired domination in graphs
• Graphs with large paired-domination number
• Upper bounds on the paired-domination number
• Paired-domination game played on cycles
• The paired-domination and the upper paired-domination numbers of graphs
• A note on the upper bound for the paired-domination number of a graph with minimum degree at least two

This page was built for publication: An upper bound on the paired-domination number in terms of the number of edges in the graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q710582)