Paired-domination of trees
From MaRDI portal
Recommendations
Cited in
(54)- A polynomial-time algorithm for the paired-domination problem on permutation graphs
- A linear-time algorithm for paired-domination problem in strongly chordal graphs
- Graphs with maximum size and given paired-domination number
- Minimum 2-tuple dominating set of permutation graphs
- Which trees have a differentiating-paired dominating set?
- Perfect pairs of trees associated with a prescribed tree: An algorithmic approach
- An upper bound on the paired-domination number in terms of the number of edges in the graph
- Linear-time algorithm for paired-domination on distance-hereditary graphs
- Paired-domination problem on distance-hereditary graphs
- Vertices contained in all or in no minimum paired-dominating set of a tree
- Trees with large paired-domination number
- Trees with equal domination and paired-domination numbers.
- Lower bound on the paired domination number of a tree
- Paired domination in trees
- Algorithmic aspects of upper paired-domination in graphs
- Upper paired-domination in claw-free graphs
- An optimal algorithm to find minimum k-hop dominating set of interval graphs
- Paired-domination in inflated graphs
- An optimal algorithm for computing minimum k-hop dominating set of permutation graphs
- Complexity of distance paired-domination problem in graphs
- Linear-time algorithm for the paired-domination problem in convex bipartite graphs
- Paired domination on interval and circular-arc graphs
- Graphs with disjoint dominating and paired-dominating sets
- Paired-domination in generalized claw-free graphs
- A linear-time algorithm for weighted paired-domination on block graphs
- Locating and paired-dominating sets in graphs
- Hardness results and approximation algorithms for (weighted) paired-domination in graphs
- A linear-time algorithm for paired-domination on circular-arc graphs
- Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs
- Paired-domination in claw-free graphs with minimum degree at least three
- A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph
- Outer-paired domination in graphs
- Vertices in all minimum paired-dominating sets of block graphs
- On bondage numbers of graphs: a survey with some comments
- Distance paired-domination problems on subclasses of chordal graphs
- Labelling algorithms for paired-domination problems in block and interval graphs
- Linear-time algorithm for the matched-domination problem in cographs
- Paired domination in graphs
- Pair-sharing over rational trees
- On the distance paired domination of generalized Petersen graphs \(P(n,1)\) and \(P(n,2)\)
- Domination parameters in coronene torus network
- Domination versus semipaired domination in trees
- Paired-domination subdivision numbers of graphs
- Graphs with large paired-domination number
- A characterization of graphs with disjoint dominating and paired-dominating sets
- Paired bondage in trees
- A characterization of \((2\gamma ,\gamma _{\text p})\)-trees
- Expected conflicts in pairs of rooted binary trees
- Constructive characterizations of \( (\gamma_p,\gamma)\)-and \( (\gamma_p, \gamma_{pr})\)-trees
- Vertices contained in all minimum paired-dominating sets of a tree
- Paired-domination in claw-free graphs
- Leaf sector covers with applications on circle graphs
- An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs
- The diameter of paired-domination vertex critical graphs
This page was built for publication: Paired-domination of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1810885)
