The following pages link to Paired-domination in graphs (Q4540077):
Displaying 50 items.
- Strong equality of Roman and weak Roman domination in trees (Q284830) (← links)
- Total and paired domination numbers of \(C_m\) bundles over a cycle \(C_n\) (Q306109) (← links)
- Upper bounds on the paired domination subdivision number of a graph (Q354438) (← links)
- Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs (Q386432) (← links)
- On graphs for which the connected domination number is at most the total domination number (Q423952) (← links)
- Perfect matchings in paired domination vertex critical graphs (Q437060) (← links)
- 2-distance paired-dominating number of graphs (Q489733) (← links)
- On the distance paired domination of generalized Petersen graphs \(P(n,1)\) and \(P(n,2)\) (Q491215) (← links)
- (Total) domination in prisms (Q510330) (← links)
- Which trees have a differentiating-paired dominating set? (Q543501) (← links)
- Paired-domination in inflated graphs (Q596115) (← links)
- Paired-domination in subdivided star-free graphs (Q604650) (← 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)
- Well paired-dominated graphs (Q711404) (← links)
- A characterization of graphs with disjoint dominating and paired-dominating sets (Q719018) (← links)
- Upper paired-domination in claw-free graphs (Q719019) (← links)
- Perfect graphs involving semitotal and semipaired domination (Q721925) (← links)
- Strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers in trees (Q726513) (← links)
- Pair dominating graphs (Q819016) (← links)
- Paired-domination subdivision numbers of graphs (Q844217) (← links)
- Graphs with large paired-domination number (Q867028) (← links)
- Dominating direct products of graphs (Q879339) (← links)
- A characterization of \((2\gamma ,\gamma _{\text p})\)-trees (Q932620) (← links)
- Ratios of some domination parameters in trees (Q932641) (← links)
- Locating and paired-dominating sets in graphs (Q967383) (← links)
- A characterization of cubic graphs with paired-domination number three-fifths their order (Q968213) (← 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-domination number of a graph and its complement (Q998404) (← links)
- Paired bondage in trees (Q998438) (← links)
- Upper bounds on the paired-domination number (Q1003575) (← links)
- A polynomial-time algorithm for the paired-domination problem on permutation graphs (Q1003667) (← links)
- Secondary domination in graphs (Q1011873) (← links)
- Paired-domination in \(P_{5}\)-free graphs (Q1014817) (← links)
- Paired domination vertex critical graphs (Q1014834) (← links)
- Dominating sets and domination polynomials of paths (Q1028883) (← 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)
- Total restrained domination in cubic graphs (Q1043826) (← links)
- \(H\)-domination in graphs (Q1415548) (← links)
- Computing a minimum paired-dominating set in strongly orderable graphs (Q1634760) (← links)
- Domination parameters with number 2: interrelations and algorithmic consequences (Q1682877) (← links)
- A note on domination and total domination in prisms (Q1698053) (← links)
- Total domination versus paired-domination in regular graphs (Q1708402) (← 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)
