The following pages link to Paired-domination of trees (Q1810885):
Displayed 43 items.
- Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs (Q386432) (← links)
- On the distance paired domination of generalized Petersen graphs \(P(n,1)\) and \(P(n,2)\) (Q491215) (← links)
- Which trees have a differentiating-paired dominating set? (Q543501) (← links)
- Paired-domination in inflated graphs (Q596115) (← links)
- Graphs with disjoint dominating and paired-dominating sets (Q607427) (← links)
- Linear-time algorithm for the paired-domination problem in convex bipartite graphs (Q692884) (← links)
- An upper bound on the paired-domination number in terms of the number of edges in the graph (Q710582) (← links)
- A characterization of graphs with disjoint dominating and paired-dominating sets (Q719018) (← links)
- Upper paired-domination in claw-free graphs (Q719019) (← links)
- Paired-domination subdivision numbers of graphs (Q844217) (← links)
- Graphs with large paired-domination number (Q867028) (← links)
- A characterization of \((2\gamma ,\gamma _{\text p})\)-trees (Q932620) (← links)
- Locating and paired-dominating sets in graphs (Q967383) (← links)
- Labelling algorithms for paired-domination problems in block and interval graphs (Q987497) (← links)
- A linear-time algorithm for paired-domination problem in strongly chordal graphs (Q990092) (← links)
- Vertices contained in all or in no minimum paired-dominating set of a tree (Q995930) (← links)
- Paired bondage in trees (Q998438) (← links)
- A polynomial-time algorithm for the paired-domination problem on permutation graphs (Q1003667) (← links)
- Constructive characterizations of \( (\gamma_p,\gamma)\)-and \( (\gamma_p, \gamma_{pr})\)-trees (Q1032812) (← links)
- Hardness results and approximation algorithms for (weighted) paired-domination in graphs (Q1034626) (← links)
- Distance paired-domination problems on subclasses of chordal graphs (Q1034627) (← links)
- Paired-domination in claw-free graphs with minimum degree at least three (Q1730243) (← links)
- Complexity of distance paired-domination problem in graphs (Q1758170) (← links)
- Vertices in all minimum paired-dominating sets of block graphs (Q1928534) (← links)
- On bondage numbers of graphs: a survey with some comments (Q1953664) (← links)
- Paired-domination problem on distance-hereditary graphs (Q2006943) (← links)
- A linear-time algorithm for weighted paired-domination on block graphs (Q2168726) (← links)
- Algorithmic aspects of upper paired-domination in graphs (Q2283034) (← links)
- A linear-time algorithm for paired-domination on circular-arc graphs (Q2354407) (← links)
- Paired domination on interval and circular-arc graphs (Q2384392) (← links)
- A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph (Q2446306) (← links)
- Graphs with maximum size and given paired-domination number (Q2449089) (← links)
- Paired-domination in generalized claw-free graphs (Q2460102) (← links)
- Minimum 2-tuple dominating set of permutation graphs (Q2511387) (← links)
- Domination parameters in coronene torus network (Q2516501) (← links)
- Paired-domination in claw-free graphs (Q2637727) (← links)
- Linear-time algorithm for the matched-domination problem in cographs (Q3101607) (← links)
- Paired Domination in Graphs (Q3384606) (← links)
- The diameter of paired-domination vertex critical graphs (Q3624924) (← links)
- An optimal algorithm to find minimum k-hop dominating set of interval graphs (Q4634287) (← links)
- An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs (Q4985488) (← links)
- Outer-paired domination in graphs (Q5859480) (← links)
- Linear-time algorithm for paired-domination on distance-hereditary graphs (Q6113862) (← links)