Graphs with large paired-domination number
From MaRDI portal
Publication:867028
DOI10.1007/S10878-006-9014-8zbMATH Open1108.05069OpenAlexW1982427590MaRDI QIDQ867028FDOQ867028
Authors: Michael A. Henning 
Publication date: 14 February 2007
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-006-9014-8
Recommendations
- An upper bound on the paired-domination number in terms of the number of edges in the graph
- The paired-domination and the upper paired-domination numbers of graphs
- All graphs with paired-domination number two less than their order
- Bounds on the paired domination number of graphs with minimum degree at least three
- Upper bounds on the paired-domination number
Cites Work
- Paired-domination in claw-free cubic graphs
- Paired-domination in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Paired-domination of trees
- Trees with large paired-domination number
- Title not available (Why is that?)
- Total and paired-domination numbers of a tree
- Paired-domination
- 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
Cited In (41)
- My favorite domination conjectures in graph theory are bounded
- SIGNED ROMAN DOMINATION NUMBER AND JOIN OF GRAPHS
- Graphs with maximum size and given paired-domination number
- A polynomial-time algorithm for the paired-domination problem on permutation graphs
- Upper bounds for the paired-domination numbers of graphs
- Which trees have a differentiating-paired dominating set?
- An upper bound on the paired-domination number in terms of the number of edges in the graph
- Paired-domination number of a graph and its complement
- Well paired-dominated graphs
- Upper paired-domination in claw-free graphs
- Bounds on the semipaired domination number of graphs with minimum degree at least two
- Title not available (Why is that?)
- Paired domination in graphs: a survey and recent results
- Graphs with disjoint dominating and paired-dominating sets
- Locating and paired-dominating sets in graphs
- Paired-domination in claw-free graphs with minimum degree at least three
- Outer-paired domination in graphs
- Paired-domination number of claw-free odd-regular graphs
- Upper paired domination versus upper domination
- Vertices in all minimum paired-dominating sets of block graphs
- Bounds on domination parameters in graphs: a brief survey
- Distance paired-domination problems on subclasses of chordal graphs
- Graphs with large semipaired domination number
- Bounds on the paired domination number of graphs with minimum degree at least three
- Labelling algorithms for paired-domination problems in block and interval graphs
- Paired domination in graphs
- 2-distance paired-dominating number of graphs
- Pair dominating graphs
- Paired-domination subdivision numbers of graphs
- Families of pairs of graphs with a large number of common cards
- Upper bounds on the paired-domination number
- A characterization of graphs with disjoint dominating and paired-dominating sets
- Paired-domination in claw-free graphs
- All graphs with paired-domination number two less than their order
- 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
- The largest parity demigenus of a simple graph
- Total domination versus paired-domination in regular graphs
- Semipaired domination in claw-free cubic graphs
- A characterization of cubic graphs with paired-domination number three-fifths their order
- The diameter of paired-domination vertex critical graphs
This page was built for publication: Graphs with large paired-domination number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q867028)
