An upper bound on the paired-domination number in terms of the number of edges in the graph
DOI10.1016/J.DISC.2010.06.033zbMATH Open1248.05139OpenAlexW2060681653MaRDI QIDQ710582FDOQ710582
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
Recommendations
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Trees with paired-domination number twice their domination number
- Paired-domination in claw-free cubic graphs
- Paired-domination in graphs
- Title not available (Why is that?)
- Paired-domination of Cartesian products of graphs
- Paired-domination of trees
- A polynomial-time algorithm for the paired-domination problem on permutation graphs
- Paired domination on interval and circular-arc graphs
- Paired-domination in generalized claw-free graphs
- Trees with large paired-domination number
- Title not available (Why is that?)
- The diameter of paired-domination vertex critical graphs
- Total and paired-domination numbers of a tree
- Upper bounds on the paired-domination number
- Graphs with large paired-domination number
- A characterization of cubic graphs with paired-domination number three-fifths their order
- Paired-domination
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Vertices contained in all or in no minimum paired-dominating set of a tree
- Paired-domination in \(P_{5}\)-free graphs
- Paired-domination number of a graph and its complement
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
- Title not available (Why is that?)
- Paired domination in graphs: a survey and recent results
- Bounds on the paired domination number of graphs with minimum degree at least three
- Paired domination in graphs
- Upper bounds on the paired domination subdivision number of a graph
- Graphs with large paired-domination number
- Paired-domination game played on cycles
- Upper bounds on the paired-domination number
- 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)
